Formal relationship between graph grammars and Petri nets
From MaRDI portal
Publication:4645283
DOI10.1007/3-540-61228-9_94zbMATH Open1412.68108OpenAlexW1538310288MaRDI QIDQ4645283FDOQ4645283
Authors: Martin Korff, Leila Ribeiro 
Publication date: 10 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61228-9_94
Recommendations
Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- System modelling with high-level Petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic high-level net transformation systems
- Petri nets and algebraic specifications
- Petri nets are monoids
- On categorical graph grammars integrating structural transformations and operations on labels
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic approach to single-pushout graph transformation
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
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)
