Rewrite Systems with Constraints

DOI10.1016/S1571-0661(04)00216-6zbMath1260.68279OpenAlexW2052008490MaRDI QIDQ4917083

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

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

Related Items (1)

Reachability is decidable for weakly extended process rewrite systems

Cites Work

• On the regular structure of prefix rewriting
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Structured operational semantics and bisimulation as a congruence
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rewrite Systems with Constraints