On extensions of process rewrite systems: rewrite systems with weak finite-state unit

MaRDI QIDQ2847415zbMATH OpenFDO

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

Publication date 9 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S157106610405056X

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

• CONCUR 2004 - Concurrency Theory
• scientific article; zbMATH DE number 1231599
• Process rewrite systems.
• Reachability is decidable for weakly extended process rewrite systems
• Rewrite systems with constraints

Cited in

(6)

• On decidability of LTL model checking for process rewrite systems
• Reachability is decidable for weakly extended process rewrite systems
• On symbolic verification of weakly extended PAD
• Rewrite systems with constraints
• On Decidability of LTL+Past Model Checking for Process Rewrite Systems
• CONCUR 2004 - Concurrency Theory

This page was built for publication: On extensions of process rewrite systems: rewrite systems with weak finite-state unit

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