Rewrite systems with constraints

DOI10.1016/S1571-0661(04)00216-6MaRDI QIDQ4917083zbMATH OpenOpenAlexFDO

Authors Jan Strejček

Publication date 26 April 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0661(04)00216-6

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

• On extensions of process rewrite systems: rewrite systems with weak finite-state unit
• Process rewrite systems.
• scientific article; zbMATH DE number 1231599
• CONCUR 2004 - Concurrency Theory
• Confluence of prefix-constrained rewrite systems

Cites work

• A calculus of communicating systems
• Algebra of communicating processes with abstraction
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1231599 (Why is no real title available?)
• scientific article; zbMATH DE number 1064110 (Why is no real title available?)
• On the regular structure of prefix rewriting
• Structured operational semantics and bisimulation as a congruence

Cited in

(3)

• Reachability is decidable for weakly extended process rewrite systems
• On extensions of process rewrite systems: rewrite systems with weak finite-state unit
• Computing with rewrite systems

This page was built for publication: Rewrite systems with constraints

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