Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Timed automata with integer resets : language Inclusion and Expressiveness

Tools
- Tools
+ Tools

Pasupuleti, Vijay S., Pandyai, Paritosh K., Krishna, Shankara Narayanan and Manasa, Lakshmi (2008) Timed automata with integer resets : language Inclusion and Expressiveness. In: 6th International Conference, FORMATS 2008, Malo, France, 15-17 Sep 2008. Published in: Formal Modeling and Analysis of Timed Systems, 5215 pp. 78-92. ISBN 9783540857778. doi:10.1007/978-3-540-85778-5_7 ISSN 0302-9743.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1007/978-3-540-85778-5_7

Request Changes to record.

Abstract

In this paper, we consider a syntactic subset of timed automata called integer reset timed automata (IRTA) where resets are restricted to occur at integral time points. We argue with examples that the notion of global sparse time base used in time triggered architecture and distributed web services can naturally be modelled/specified as IRTA. As our main result, we show that the language inclusion problem L(A)⊆L(B) for a timed automaton A and an IRTA B is decidable with EXPSPACE complexity. The expressive power and the closure properties of IRTA are also summarized. In particular, the IRTA are (highly succinct but) expressively equivalent to 1-clock deterministic IRTA and they are closed under boolean operations.

Item Type: Conference Item (Paper)
Divisions: Faculty of Science, Engineering and Medicine > Engineering > WMG (Formerly the Warwick Manufacturing Group)
Journal or Publication Title: Formal Modeling and Analysis of Timed Systems
Publisher: Springer Berlin Heidelberg
ISBN: 9783540857778
ISSN: 0302-9743
Book Title: Formal Modeling and Analysis of Timed Systems
Official Date: 2008
Dates:
DateEvent
2008Published
Volume: 5215
Page Range: pp. 78-92
DOI: 10.1007/978-3-540-85778-5_7
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Conference Paper Type: Paper
Title of Event: 6th International Conference, FORMATS 2008
Type of Event: Conference
Location of Event: Malo, France
Date(s) of Event: 15-17 Sep 2008

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us