Extended process rewrite systems: Expressiveness and reachability

DOI10.1007/978-3-540-28644-8_23MaRDI QIDQ5311485zbMATH OpenOpenAlexFDO

Authors Vojtěch Řehák, Jan Strejček, Mojmír Křetínský

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Reachability is decidable for weakly extended process rewrite systems
• Process rewrite systems.
• scientific article; zbMATH DE number 1231599
• On extensions of process rewrite systems: rewrite systems with weak finite-state unit
• On computing reachability sets of process rewrite systems

Cited in

(19)

• On decidability of LTL model checking for process rewrite systems
• Generating priority rewrite systems for OSOS process languages
• Reachability is decidable for weakly extended process rewrite systems
• Process rewrite systems.
• Petri nets are less expressive than state-extended PA
• Tree regular model checking: a simulation-based approach
• On extensions of process rewrite systems: rewrite systems with weak finite-state unit
• On symbolic verification of weakly extended PAD
• The Decidability of the Reachability Problem for CCS!
• scientific article; zbMATH DE number 1231599 (Why is no real title available?)
• Rewrite systems with constraints
• Bounded communication reachability analysis of process rewrite systems with ordered parallelism
• On Decidability of LTL+Past Model Checking for Process Rewrite Systems
• scientific article; zbMATH DE number 2214253 (Why is no real title available?)
• On computing reachability sets of process rewrite systems
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• Decidable models of integer-manipulating programs with recursive parallelism
• Decidability issues for extended ping-pong protocols

This page was built for publication: Extended process rewrite systems: Expressiveness and reachability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311485)