Relaxed models for rewriting logic
From MaRDI portal
Publication:1853590
DOI10.1016/S0304-3975(01)00331-0zbMath1018.68036MaRDI QIDQ1853590
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q42: Grammars and rewriting systems
Related Items
Uses Software
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