Verification of recursive parallel systems

In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRSs). For a meaningfull fragment of PRSs, allowing to accommodate both Pushdown Automata and Petri Nets, we state decidability results for a class of properties about infinite derivations (infinite term rewritings). The given results can be exploited for the automatic verification of some classes of linear time properties of infinite state systems described by PRSs. In order to exemplify the assessed results, we introduce a meaningful automaton based formalism which allows to express both recursion and multi–treading.

[1]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

[2]  Javier Esparza,et al.  On the Decidability of Model Checking for Several µ-calculi and Petri Nets , 1994, CAAP.

[3]  Richard Mayr.  Decidability and complexity of model checking problems for infinite state systems , 1998 .

[4]  Faron Moller,et al.  Infinite Results , 1996, CONCUR.

[5]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[6]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[7]  Sampath Kannan,et al.  Communicating Hierarchical State Machines , 1999, ICALP.

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

[9]  Rajeev Alur,et al.  Model checking of hierarchical state machines , 1998, TOPL.

[10]  Bran Selic,et al.  Real-time object oriented modeling and design , 1994 .

[11]  Javier Esparza,et al.  Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.

[12]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[13]  Rajeev Alur,et al.  Analysis of Recursive State Machines , 2001, CAV.

[14]  Hardi Hungar,et al.  Model Checking of macro Processes , 1994, CAV.

[15]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[16]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[17]  Andrea Maggiolo-Schettini,et al.  Dynamic Hierarchical Machines , 2003, Fundam. Informaticae.

[18]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.