Process rewrite systems.

DOI10.1006/inco.1999.2826zbMath1046.68566MaRDI QIDQ1854328

Richard Mayr

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/98579b5e60ba8f3372a6ac7102680733d885324b

zbMATH Keywords

Petri nets; PA-processes; pushdown processes

Mathematics Subject Classification ID

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

68Q42: Grammars and rewriting systems

Related Items

Decidability of model checking with the temporal logic EF, Deciding bisimulation-like equivalences with finite-state processes, Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, On the computational complexity of bisimulation, redux, Decidability issues for extended ping-pong protocols, Reachability analysis of fragments of mobile ambients in AC term rewriting, Verification of well-formed communicating recursive state machines, On decidability of LTL model checking for process rewrite systems, Reachability is decidable for weakly extended process rewrite systems, The complexity of bisimilarity-checking for one-counter processes., Dynamic connectors for concurrency, Weak bisimilarity and regularity of context-free processes is EXPTIME-hard, Simulation preorder over simple process algebras, Recursive Petri nets, Petri nets are less expressive than state-extended PA, Model checking for process rewrite systems and a class of action-based regular properties, Decidable first-order transition logics for PA-processes

Cites Work

• On the regular structure of prefix rewriting
• Decidability of a temporal logic problem for Petri nets
• Algebra of communicating processes with abstraction
• Decidability of model checking for infinite-state concurrent systems
• An Algorithm for the General Petri Net Reachability Problem
• Reachability analysis of pushdown automata: Application to model-checking
• Model checking PA-processes
• Infinite results
• Bisimulation collapse and the process taxonomy
• Constrained properties, semilinear systems, and Petri nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item