Theoretical Computer Science
Undecidable verification problems for programs with unreliable channels
Information and Computation
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Timing analysis of asynchronous circuits using timed automata
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Reachability and Safety in Queue Systems
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Stability of Time-Delay Systems
Stability of Time-Delay Systems
Reachability analysis of a switched buffer network
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
The Digraph Real-Time Task Model
RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
On the verification of timed discrete-event models
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
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.