scientific article; zbMATH DE number 1231599

MaRDI QIDQ4222920zbMATH OpenFDO

Authors Richard M. Mayr

Publication date 21 December 1998

Full work available at URL http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume3.htm#mayr

zbMATH Keywords

concurrent systemsrewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Process rewrite systems.
• CONCUR 2004 - Concurrency Theory
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Verification, Model Checking, and Abstract Interpretation
• Model checking for process rewrite systems and a class of action-based regular properties

Cited in

(14)

• Reachability is decidable for weakly extended process rewrite systems
• Process rewrite systems.
• Model checking for process rewrite systems and a class of action-based regular properties
• On extensions of process rewrite systems: rewrite systems with weak finite-state unit
• Rewrite systems with constraints
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• CONCUR 2004 - Concurrency Theory
• Rewriting Systems with Data
• scientific article; zbMATH DE number 2214253 (Why is no real title available?)
• Term Rewriting and Applications
• Verification, Model Checking, and Abstract Interpretation
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• Decidability of model checking with the temporal logic EF

This page was built for publication:

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