Decidability of bisimulation equivalence for processes generating context-free languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Process algebra
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Handbook of formal languages, vol. 3
Term rewriting and all that
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Communication and Concurrency
A Formal Framework for the Analysis of Recursive-Parallel Programs
PaCT '97 Proceedings of the 4th International Conference on Parallel Computing Technologies
Combining Petri Nets and PA-Processes
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Deciding Bisimulation-Like Equivalences with Finite-State Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Reachability Problem for Ground TRS and Some Extensions
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
How to Parallelize Sequential Processes
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Regularity is Decidable for Normed PA Processes in Polynomial Time
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Tableau Methods for PA-Processes
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A generic approach to the static analysis of concurrent programs with procedures
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An automata-theoretic approach to the reachability analysis of RPPS systems
Nordic Journal of Computing
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Synchronized Tree Languages Revisited and New Applications
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Languages, Rewriting Systems, and Verification of Infinite-State Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Precise interprocedural dependence analysis of parallel programs
Theoretical Computer Science
Regular symbolic analysis of dynamic networks of pushdown systems
CONCUR 2005 - Concurrency Theory
Decidable first-order transition logics for PA-processes
Information and Computation
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
On the analysis of interacting pushdown systems
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A regular viewpoint on processes and algebra
Acta Cybernetica
Visibly Pushdown Languages and Term Rewriting
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reachability Analysis of Synchronized PA Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable first-order transition logics for PA-processes
Information and Computation
Normalization of linear horn clauses
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Model checking multithreaded programs with asynchronous atomic methods
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Solving first order formulae of pseudo-regular theory
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Reachability problem for weak multi-pushdown automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 5.23 |
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes astrees, and usingtree-automata techniques for verification problems on PA. Our main result is that the set of iterated predecessors of a regular set of PA-processes is a regular tree language, and similarly for iterated successors. Furthermore, the corresponding tree automata can be built effectively in polynomial time. This has many immediate applications to verification problems for PA-processes, among which a simple and general model-checking algorithm.