An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems

We show how the reachability analysis of RPPS systems can be tackled with the tree-automata techniques proposed by Lugiez and Schnoebelen for PA. This approach requires that we express the states of RPPS systems in RPA, a tailor-made process rewrite system where reachability is a relation recognizable by finite tree-automata. Two outcomes of this study are (1) an NP algorithm for reachability in RPPS systems, and (2) a simple decision procedure for a large class of reachability problems in RPA systems.

[1]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[2]  Andreas Podelski,et al.  Efficient algorithms for pre* and post* on interprocedural parallel flow graphs , 2000, POPL '00.

[3]  Philippe Schnoebelen,et al.  A model for recursive-parallel programs , 1996, INFINITY.

[4]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[5]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[6]  Yuji Matsumoto,et al.  Guarded Horn Clauses and Experience with Parallel Logic Programming , 1986, FJCC.

[7]  Philippe Schnoebelen,et al.  The regular viewpoint on PA-processes , 2002, Theor. Comput. Sci..

[8]  Jens Knoop,et al.  An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis , 1999, FoSSaCS.

[9]  Richard Mayr,et al.  Process rewrite systems , 1999, EXPRESS.

[10]  Jean-Claude Raoult.  Rational tree relations , 1997 .

[11]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[12]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[13]  Orna Kupferman,et al.  An Automata-Theoretic Approach to Reasoning about Infinite-State Systems , 2000, CAV.

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

[15]  Dov M. Gabbay,et al.  Handbook of logic in computer science. Volume 2. Background: Computational structures , 1993, LICS 1993.

[16]  Moshe Y. Vardi.  Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics , 1997, CADE.

[17]  Moshe Y. Vardi.  Alternating Automata: Checking Truth and Validity for Temporal Logics , 1998 .

[18]  Philippe Schnoebelen,et al.  Decidable First-Order Transition Logics for PA-Processes , 2000, ICALP.

[19]  Didier Caucal.  On Word Rewriting Systems Having a Rational Derivation , 2000, FoSSaCS.

[20]  Richard Mayr.  Tableau Methods for PA-Processes , 1997, TABLEAUX.

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

[22]  Philippe Schnoebelen,et al.  A Formal Framework for the Analysis of Recursive-Parallel Programs , 1997, PaCT.

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

[24]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

[25]  Richard Mayr.  Decidability of model checking with the temporal logic EF , 2001, Theor. Comput. Sci..

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