Formal relationship between graph grammars and Petri nets
From MaRDI portal
Publication:4645283
Recommendations
Cites work
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3711390 (Why is no real title available?)
- scientific article; zbMATH DE number 3711391 (Why is no real title available?)
- scientific article; zbMATH DE number 50851 (Why is no real title available?)
- scientific article; zbMATH DE number 107927 (Why is no real title available?)
- scientific article; zbMATH DE number 177420 (Why is no real title available?)
- scientific article; zbMATH DE number 3624774 (Why is no real title available?)
- scientific article; zbMATH DE number 10083 (Why is no real title available?)
- scientific article; zbMATH DE number 1418813 (Why is no real title available?)
- Algebraic approach to single-pushout graph transformation
- Algebraic high-level net transformation systems
- On categorical graph grammars integrating structural transformations and operations on labels
- Petri nets and algebraic specifications
- Petri nets are monoids
- System modelling with high-level Petri nets
Cited in
(7)- scientific article; zbMATH DE number 3909750 (Why is no real title available?)
- scientific article; zbMATH DE number 4062633 (Why is no real title available?)
- Graph-token Petri nets
- Lectures on Concurrency and Petri Nets
- scientific article; zbMATH DE number 2087495 (Why is no real title available?)
- scientific article; zbMATH DE number 3846890 (Why is no real title available?)
- scientific article; zbMATH DE number 3890743 (Why is no real title available?)
This page was built for publication: Formal relationship between graph grammars and Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645283)