Synthesising elementary net systems with localities
From MaRDI portal
Publication:2077411
DOI10.1016/j.tcs.2022.01.042OpenAlexW4210696535MaRDI QIDQ2077411
Marta Pietkiewicz-Koutny, Aishah Ahmed, Maciej Koutny
Publication date: 21 February 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.042
localityPetri netanalysis and synthesistransition systemtheory of regionsstep sequence semanticsmembrane systemGALS systemtheory of concurrencyworkcraft framework
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mobility in process calculi and natural computing.
- P systems without multiplicities of symbol-objects
- Petri net synthesis
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Elementary transition systems
- Analysis and identification of speed-independent circuits on an event model
- The synthesis problem for elementary net systems is NP-complete
- Computing with membranes
- Distributing finite automata through Petri net synthesis
- A guide to membrane computing.
- Membrane computing. An introduction.
- A logical study of distributed transition systems
- Memory associated with membranes systems
- Minimal Regions of ENL-Transition Systems
- PETRI NETS AND STEP TRANSITION SYSTEMS
- Logic Synthesis for Asynchronous Controllers and Interfaces
- Transition Systems of Elementary Net Systems with Localities
- Membrane Computing
This page was built for publication: Synthesising elementary net systems with localities