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.
Type de document :
Communication dans un congrès
Frank Pfenning. 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. Springer, 7794, pp.81-96, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-37075-5_6〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00744085
Contributeur : Frédéric Herbreteau <>
Soumis le : lundi 22 octobre 2012 - 11:56:52
Dernière modification le : mercredi 11 avril 2018 - 02:00:30

Lien texte intégral

Identifiants

Citation

Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre. Reachability of Communicating Timed Processes. Frank Pfenning. 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. Springer, 7794, pp.81-96, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-37075-5_6〉. 〈hal-00744085〉

Partager

Métriques

Consultations de la notice

250