Timed Basic Parallel Processes

Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extension of timed automata (TA) with context-free branching rules, and as such may be used to model networks of independent timed automata with process creation. We show that the coverability and reachability problems (with unary encoded target multiplicities) are PSPACE-complete and EXPTIME-complete, respectively. For the special case of 1-clock TBPP, both are NP-complete and hence not more complex than for untimed BPP. This contrasts with known super-Ackermannian-completeness and undecidability results for general timed Petri nets. As a result of independent interest, and basis for our NP upper bounds, we show that the reachability relation of 1-clock TA can be expressed by a formula of polynomial size in the existential fragment of linear arithmetic, which improves on recent results from the literature.

[1]  Philippe Schnoebelen,et al.  Model Checking Timed Automata with One or Two Clocks , 2004, CONCUR.

[2]  Kim G. Larsen,et al.  Almost Optimal Strategies in One Clock Priced Timed Games , 2006, FSTTCS.

[3]  Hubert Comon-Lundh,et al.  Timed Automata and the Theory of Real Numbers , 1999, CONCUR.

[4]  Parosh Aziz Abdulla,et al.  Perfect Timed Communication Is Hard , 2018, FORMATS.

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

[6]  Catalin Dima,et al.  Computing reachability relations in timed automata , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[7]  Peter Bro Miltersen,et al.  A Faster Algorithm for Solving One-Clock Priced Timed Games , 2013, CONCUR.

[8]  John Fearnley,et al.  Reachability in two-clock timed automata is PSPACE-complete , 2013, Inf. Comput..

[9]  Volker Weispfenning,et al.  Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[10]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1995, FCT.

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

[12]  Philippe Schnoebelen,et al.  The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[13]  Gerhard Goos,et al.  Automated Technology for Verification and Analysis , 2004, Lecture Notes in Computer Science.

[14]  Marcin Jurdzinski,et al.  Model Checking Probabilistic Timed Automata with One or Two Clocks , 2008, Log. Methods Comput. Sci..

[15]  Louchka Popova-Zeugmann,et al.  On Time Petri Nets , 1991, J. Inf. Process. Cybern..

[16]  Parosh Aziz Abdulla,et al.  Model checking of systems with many identical timed processes , 2003, Theor. Comput. Sci..

[17]  Parosh Aziz Abdulla,et al.  Universal Safety for Timed Petri Nets is PSPACE-complete , 2018, CONCUR.

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

[19]  David de Frutos-Escrig,et al.  On non-decidability of reachability for timed-arc Petri nets , 1999, PNPM.

[20]  Pierre Wolper,et al.  An effective decision procedure for linear arithmetic over the integers and reals , 2005, TOCL.

[21]  Marcin Jurdzinski,et al.  Comparing Timed C/E Systems with Timed Automata , 1996 .

[22]  Lorenzo Clemente,et al.  Decidability of Timed Communicating Automata , 2018, ArXiv.

[23]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

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

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

[26]  Joël Ouaknine,et al.  On the decidability of metric temporal logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

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

[28]  Jeanne Ferrante,et al.  A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..

[29]  Slawomir Lasota,et al.  Alternating timed automata , 2005, TOCL.

[30]  Philippe Schnoebelen,et al.  Verifying Performance Equivalence for Timed Basic Parallel Processes , 2000, FoSSaCS.

[31]  James Worrell,et al.  Effective Definability of the Reachability Relation in Timed Automata , 2019, Inf. Process. Lett..

[32]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[33]  Lorenzo Clemente,et al.  Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms , 2018, ICALP.

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

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

[36]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[37]  Thomas Schwentick,et al.  On the Complexity of Equational Horn Clauses , 2005, CADE.

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

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

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

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

[42]  Catalin Dima.  A Class of Automata for Computing Reachability Relations in Timed Systems , 2005, VISSAS.

[43]  Adriano Peron,et al.  Timed recursive state machines: Expressiveness and complexity , 2016, Theor. Comput. Sci..

[44]  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).

[45]  Pavel Krcál,et al.  On Sampled Semantics of Timed Systems , 2005, FSTTCS.

[46]  Zhe Dang,et al.  Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks , 2001, CAV.

[47]  Søren Christensen.  Decidability and decomposition in process algebras , 1993 .

[48]  Ashutosh Trivedi,et al.  Competative optimisation on timed automata , 2009 .