Decidability of Timed Communicating Automata

We study the reachability problem for networks of timed communicating processes. Each process is a timed automaton communicating with other processes by exchanging messages over unbounded FIFO channels. Messages carry clocks which are checked at the time of transmission and reception with suitable timing constraints. Each automaton can only access its set of local clocks and message clocks of sent/received messages. Time is dense and all clocks evolve at the same rate. Our main contribution is a complete characterisation of decidable and undecidable communication topologies generalising and unifying previous work. From a technical point of view, we use quantifier elimination and a reduction to counter automata with registers.

[1]  Lorenzo Clemente,et al.  Timed Pushdown Automata Revisited , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[2]  Zhe Dang,et al.  Pushdown timed automata: a binary reachability characterization and safety verification , 2001, Theor. Comput. Sci..

[3]  Philippe Schnoebelen,et al.  The Power of Priority Channel Systems , 2013, CONCUR.

[4]  Jürgen Dingel,et al.  A survey of timed automata for the development of real-time systems , 2013, Comput. Sci. Rev..

[5]  James Worrell,et al.  Revisiting reachability in timed automata , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

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

[7]  Parosh Aziz Abdulla,et al.  Communicating Timed Processes with Perfect Timed Channels , 2017 .

[8]  Grégoire Sutre,et al.  Safety Verification of Communicating One-Counter Machines , 2012, FSTTCS.

[9]  Lorenzo Clemente,et al.  Timed pushdown automata and branching vector addition systems , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[10]  Slawomir Lasota,et al.  Automata theory in nominal sets , 2014, Log. Methods Comput. Sci..

[11]  Igor Walukiewicz,et al.  Better Abstractions for Timed Automata , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[12]  Lorenzo Clemente,et al.  Reachability of Communicating Timed Processes , 2013, FoSSaCS.

[13]  Karin Quaas,et al.  Verification for Timed Automata Extended with Unbounded Discrete Data Structures , 2014, CONCUR.

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

[15]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

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

[17]  Ashutosh Trivedi,et al.  Recursive Timed Automata , 2010, ATVA.

[18]  Parosh Aziz Abdulla,et al.  Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[19]  Adriano Peron,et al.  Analysis of Timed Recursive State Machines , 2010, 2010 17th International Symposium on Temporal Representation and Reasoning.

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

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

[22]  Jean-Luc Lambert,et al.  A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..

[23]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

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

[25]  Parosh Aziz Abdulla,et al.  Data Communicating Processes with Unreliable Channels , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

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

[27]  Dugald Macpherson,et al.  A survey of homogeneous structures , 2011, Discret. Math..

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

[29]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[30]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

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

[32]  Ahmed Bouajjani,et al.  On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures , 1994, Hybrid Systems.

[33]  Lorenzo Clemente,et al.  Decidable Topologies for Communicating Automata with FIFO and Bag Channels , 2014, CONCUR.

[34]  Sylvain Schmitz,et al.  Demystifying Reachability in Vector Addition Systems , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[35]  Parosh Aziz Abdulla,et al.  Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness , 2006, Log. Methods Comput. Sci..

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

[37]  Paul Gastin,et al.  Towards an Efficient Tree Automata based technique for Timed Systems , 2017, CONCUR.

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

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

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