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. To account for urgency of receptions, we also investigate the case where processes can test emptiness of channels.

[1]  Alain Finkel,et al.  Verification of programs with half-duplex communication , 2005, Inf. Comput..

[2]  Parosh Aziz Abdulla,et al.  Dense-Timed Pushdown Automata , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[3]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[4]  Serge Haddad,et al.  Comparison of Different Semantics for Time Petri Nets , 2005, ATVA.

[5]  Benedikt Bollig,et al.  Distributed Timed Automata with Independently Evolving Clocks , 2008, CONCUR.

[6]  Parosh Aziz Abdulla,et al.  On the Verification of Timed Ad Hoc Networks , 2011, FORMATS.

[7]  Benedikt Bollig,et al.  Automata and Logics for Timed Message Sequence Charts , 2007, FSTTCS.

[8]  Salvatore La Torre,et al.  Context-Bounded Analysis of Concurrent Queue Systems , 2008, TACAS.

[9]  Paul Gastin,et al.  Model checking time-constrained scenario-based specifications , 2010, FSTTCS.

[10]  Barbara König,et al.  On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization , 2005, Developments in Language Theory.

[11]  Rémi Bonnet.  The Reachability Problem for Vector Addition System with One Zero-Test , 2011, MFCS.

[12]  Giorgio Delzanno,et al.  Parameterized Verification of Ad Hoc Networks , 2010, CONCUR.

[13]  Parosh Aziz Abdulla,et al.  Timed Lossy Channel Systems , 2012, FSTTCS.

[14]  Wang Yi,et al.  Communicating Timed Automata: The More Synchronous, the More Difficult to Verify , 2006, CAV.

[15]  Oscar H. Ibarra,et al.  Verification in loosely synchronous queue-connected discrete timed automata , 2003, Theor. Comput. Sci..

[16]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[17]  Philippe Schnoebelen,et al.  Mixing Lossy and Perfect Fifo Channels , 2008, CONCUR.

[18]  Klaus Reinhardt,et al.  Reachability in Petri Nets with Inhibitor Arcs , 2008, RP.

[19]  Jan K. Pachl.  Reachability problems for communicating finite state machines , 2003, ArXiv.

[20]  Anca Muscholl,et al.  Reachability Analysis of Communicating Pushdown Systems , 2010, FoSSaCS.

[21]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[22]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[23]  Madhavan Mukund,et al.  Matching Scenarios with Timing Constraints , 2006, FORMATS.