Reachability of Communicating Timed Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Reachability of Communicating Timed Processes


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.

Dates and versions

hal-00744085 , version 1 (22-10-2012)



Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre. Reachability of Communicating Timed Processes. FoSSaCS - 16th International Conference on Foundations of Software Science and Computation Structures, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS - 2013, Mar 2013, Rome, Italy. pp.81-96, ⟨10.1007/978-3-642-37075-5_6⟩. ⟨hal-00744085⟩
198 View
0 Download



Gmail Facebook Twitter LinkedIn More