Relaxed models for rewriting logic

DOI10.1016/S0304-3975(01)00331-0zbMath1018.68036MaRDI QIDQ1853590

Dorel Lucanu

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

rewriting logicrelaxed modelscategories with algebraic structure

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Rewriting logic: Roadmap and bibliography

Uses Software

• CafeOBJ

Cites Work

• An axiomatization of the algebra of Petri net concatenable processes
• Proving semantical equivalence of data specifications
• Petri nets are monoids
• Conditional rewriting logic as a unified model of concurrency
• Why tricategories?
• On the category of Petri net computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relaxed models for rewriting logic