Transformation of Petri nets into context-dependent fusion grammars
From MaRDI portal
Publication:2278280
DOI10.1007/978-3-030-13435-8_18zbMATH Open1425.68168OpenAlexW2914016264MaRDI QIDQ2278280FDOQ2278280
Authors: Sabine Kuske, Aaron Lye, Hans-Jörg Kreowski
Publication date: 4 December 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-13435-8_18
Recommendations
- Transformation of variants of Petri nets into context-dependent fusion grammars
- Lectures on Concurrency and Petri Nets
- Transformation of Turing machines into context-dependent fusion grammars
- scientific article; zbMATH DE number 3846890
- scientific article; zbMATH DE number 3909750
- Simplification of context-free grammar through Petri net
- Synthesis of Petri nets from finite partial languages
- scientific article; zbMATH DE number 2086960
- scientific article; zbMATH DE number 3890743
- scientific article; zbMATH DE number 1059894
Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (6)
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal
- Title not available (Why is that?)
- Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete
- Title not available (Why is that?)
- Lectures on Concurrency and Petri Nets
- Transformation of variants of Petri nets into context-dependent fusion grammars
This page was built for publication: Transformation of Petri nets into context-dependent fusion grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278280)