Process algebra
Handbook of logic in computer science (vol. 2)
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Journal of the ACM (JACM)
Guarded horn clauses and experiences with parallel logic programming
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation - Special issue on EXPRESS 1997
Well-structured transition systems everywhere!
Theoretical Computer Science
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
The regular viewpoint on PA-processes
Theoretical Computer Science
A Formal Framework for the Analysis of Recursive-Parallel Programs
PaCT '97 Proceedings of the 4th International Conference on Parallel Computing Technologies
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Tableau Methods for PA-Processes
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Decidable first-order transition logics for PA-processes
Information and Computation
Decidable first-order transition logics for PA-processes
Information and Computation
| Hi-index | 0.00 |
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.