skip to main content
10.1145/2380356.2380370acmconferencesArticle/Chapter ViewAbstractPublication PagesesweekConference Proceedingsconference-collections
research-article

Finite automata with time-delay blocks

Published: 07 October 2012 Publication History

Abstract

The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete.

References

[1]
R. Alur and D. L. Dill. "A Theory of Timed Automata." In: Theor. Comput. Sci. 126.2 (1994), pp. 183--235.
[2]
P.A. Abdulla and B. Jonsson. "Undecidable Verification Problems for Programs with Unreliable Channels". In: Inf. Comput. 130.1 (1996), pp. 71--90.
[3]
A. Bouajjani and P. Habermehl. "Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations". In: Theoretical Computer Science. 1998.
[4]
D. Brand and Z. Pitro. "On Communicating Finite-State Machines". In: J. ACM 30 (2 1983), pp. 323--342. issn: 0004-5411.
[5]
K. Chatterjee, T. A. Henzinger, and V. S. Prabhu. Finite Automata with Time-Delay Blocks (Extended Version)". In: CoRR arXiv:1207.7019 (2012).
[6]
J. N. Chiasson and J. J. Loiseau. Applications of time delay systems. Lecture notes in control and information sciences. Springer, 2007. isbn: 9783540495550.
[7]
J. Eker et al. "Taming heterogeneity - the Ptolemy approach". In: Proceedings of the IEEE 91.1 (2003), pp. 127--144.
[8]
G. Frehse and O. Maler. "Reachability Analysis of a Switched Buer Network". In: HSCC. 2007, pp. 698--701.
[9]
K. Gu, V.L. Kharitonov, and J. Chen. Stability of time-delay systems. Vol. 41. 12. Birkhauser, 2003, pp. 1458--1463.
[10]
O.H. Ibarra. "Reachability and Safety in Queue Systems". In: CIAA. LNCS 2088. Springer, 2000, pp. 145--156.
[11]
MathWorks. Control System Toolbox. 2012. url: http://www.mathworks.com/products/control/.
[12]
MathWorks. Simulink. 2012. url: http://www.mathworks.com/help/toolbox/simulink/slref/unitdelay.html.
[13]
O. Maler and A. Pnueli. "Timing analysis of asynchronous circuits using timed automata". In: CHARME. LNCS 987. Springer, 1995, pp. 189--205.
[14]
Ptolemy II. 2012. url: http://ptolemy.berkeley.edu/ptolemyII/.
[15]
R. Sipahi et al. Time Delay Systems: Methods, Applications and New Trends. Lecture Notes in Control and Information Sciences. Springer, 2012.
[16]
M. Stigge et al. "The Digraph Real-Time Task Model". In: RTAS. IEEE Computer Society, 2011, pp. 71--80.
[17]
Q.C. Zhong. Robust control of time-delay systems. Springer, 2006. isbn: 9781846282645.

Cited By

View all
  • (2013)On the verification of timed discrete-event modelsProceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems10.1007/978-3-642-40229-6_15(213-227)Online publication date: 29-Aug-2013

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
EMSOFT '12: Proceedings of the tenth ACM international conference on Embedded software
October 2012
266 pages
ISBN:9781450314251
DOI:10.1145/2380356
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 October 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. buffers
  2. model checking
  3. queues
  4. time-delay systems

Qualifiers

  • Research-article

Conference

ESWEEK'12
ESWEEK'12: Eighth Embedded System Week
October 7 - 12, 2012
Tampere, Finland

Acceptance Rates

Overall Acceptance Rate 60 of 203 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2013)On the verification of timed discrete-event modelsProceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems10.1007/978-3-642-40229-6_15(213-227)Online publication date: 29-Aug-2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media