Theoretical Computer Science
On Communicating Finite-State Machines
Journal of the ACM (JACM)
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Verification in loosely synchronous queue-connected discrete timed automata
Theoretical Computer Science
Distributed Timed Automata with Independently Evolving Clocks
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Mixing Lossy and Perfect Fifo Channels
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Reachability in Petri Nets with Inhibitor Arcs
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of programs with half-duplex communication
Information and Computation
Automata and logics for timed message sequence charts
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Context-bounded analysis of concurrent queue systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Parameterized verification of ad hoc networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
The reachability problem for vector addition system with one zero-test
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Comparison of different semantics for time petri nets
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Matching scenarios with timing constraints
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
On timed automata with discrete time – structural and language theoretical characterization
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Communicating timed automata: the more synchronous, the more difficult to verify
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of local clocks; all clocks evolve at the same rate. Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time. We also obtain complexity results, by showing that communicating timed processes are at least as hard as Petri nets; in the discrete time, we also show equivalence with Petri nets. Our results follow from mutual topology-preserving reductions between timed automata and (untimed) counter automata. To account for urgency of receptions, we also investigate the case where processes can test emptiness of channels.