The regular viewpoint on PA-processes

DOI10.1016/S0304-3975(00)00306-6zbMath0992.68150MaRDI QIDQ5958465

Denis Lugiez, Philippe Schnoebelen

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

process algebra; tree automata; verification of infinite-state systems

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Precise interprocedural dependence analysis of parallel programs, A general approach to comparing infinite-state systems with their finite-state specifications, Decidable first-order transition logics for PA-processes, Normalization of Linear Horn Clauses, PDL with intersection and converse: satisfiability and infinite-state model checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the regular structure of prefix rewriting
• Rational tree relations
• Process Algebra
• Tableau methods for PA-processes
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• Regular canonical systems
• An automata-theoretic approach to branching-time model checking
• Deciding bisimulation-like equivalences with finite-state processes
• Reachability analysis of pushdown automata: Application to model-checking
• How to Parallelize sequential processes
• Model checking PA-processes
• Infinite results