Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
We study channel systems whose behaviour (sending and receiving messages via unbounded FIFO channels) must follow given timing constraints specifying the execution speeds of the local components. We propose Communicating Timed Automata (CTA) to model such systems. The goal is to study the borderline between decidable and undecidable classes of channel systems in the timed setting. Our technical results include: (1) CTA with one channel without shared states in the form (A 1,A 2, c 1,2) is equivalent to one-counter machine, implying that verification problems such as checking state reachability and channel boundedness are decidable, and (2) CTA with two channels without sharing states in the form (A 1,A 2,A 3, c 1,2,c 2,3) has the power of Turing machines. Note that in the untimed setting, these systems are no more expressive than finite state machines. This shows that the capability of synchronizing on time makes it substantially more difficult to verify channel systems.
KeywordsTuring Machine Expressive Power Channel System Regular Language State Reachability
- [KY06]Krcal, P., Yi, W.: Communicating timed automata. Technical Report 2006-008, Uppsala University (2006)Google Scholar
- [Pac82]Pachl, J.K.: Reachability problems for communicating finite state machines. Technical Report CS-82-12, Department of Computer Science, University of Waterloo (1982)Google Scholar
- [Pac03]Pachl, J.K.: Reachability problems for communicating finite state machines. ArXiv Computer Science e-prints, arXiv:cs/0306121 (2003)Google Scholar