Relaxed models for rewriting logic

DOI10.1016/S0304-3975(01)00331-0MaRDI QIDQ1853590zbMATH OpenFDO

Authors Dorel Lucanu

Publication date 21 January 2003

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

Full work available at URL https://doi.org/10.1016/S0304-3975(01)00331-0

zbMATH Keywords

categories with algebraic structurerelaxed modelsrewriting logic

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Modal logic for rewriting theories
• Relating two categorical models of term rewriting
• Semantic foundations for generalized rewrite theories
• Formal Methods in Software and Systems Modeling
• scientific article; zbMATH DE number 1342254

Cites work

• An axiomatization of the algebra of Petri net concatenable processes
• CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
• Conditional rewriting logic as a unified model of concurrency
• scientific article; zbMATH DE number 4033040 (Why is no real title available?)
• scientific article; zbMATH DE number 1390080 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• On the category of Petri net computations
• Petri nets are monoids
• Proving semantical equivalence of data specifications
• Why tricategories?

Cited in

(1)

• Rewriting logic: Roadmap and bibliography

Describes a project that uses

Uses Software

• CafeOBJ

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

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