Skip to Main content Skip to Navigation
Conference papers

Reachability of Communicating Timed Processes

Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Frédéric Herbreteau Connect in order to contact the contributor
Submitted on : Monday, October 22, 2012 - 11:56:52 AM
Last modification on : Saturday, June 25, 2022 - 7:44:19 PM

Links full text



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⟩



Record views