PETRI NETS AND STEP TRANSITION SYSTEMS
DOI10.1142/S0129054192000231zbMATH Open0774.68086OpenAlexW1978994556MaRDI QIDQ4032923FDOQ4032923
Authors: Madhavan Mukund 
Publication date: 16 May 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054192000231
Recommendations
- Petri-Netze
- scientific article; zbMATH DE number 979001
- scientific article; zbMATH DE number 3922334
- Petri nets
- scientific article; zbMATH DE number 1973130
- Transition systems, link graphs and Petri nets
- Petri nets and bisimulation
- Analysis of Petri nets and transition systems
- scientific article; zbMATH DE number 4001494
- Petri nets and regular processes
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (42)
- Trace nets and process automata
- On the Step Explosion Problem
- Functorial models for Petri nets
- Title not available (Why is that?)
- Projection approaches to process mining using region-based techniques
- Petri nets and bisimulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparing transition systems with independence and asynchronous transition systems
- Pomset Languages of Finite Step Transition Systems
- \(\{\mathrm{SC}\}^\ast\mathrm{ECS}\): a class of modular and hierarchical cooperating systems
- The synthesis of Petri nets from path-automatic specifications
- Regions of Petri nets with a/sync connections
- Clustering for Petri nets
- On the Petri net realization of context-free graphs
- Synthesis of nets with inhibitor arcs
- Transition systems of Elementary Net Systems with inhibitor arcs
- Title not available (Why is that?)
- Applying regions
- The synthesis problem for elementary net systems is NP-complete
- Elementary transition systems
- Formal relationships between geometrical and classical models for concurrency
- An event structure semantics for general Petri nets
- Synthesis of Petri nets with whole-place operations and localities
- The synthesis problem of Petri nets
- Title not available (Why is that?)
- Factorisation of Petri net solvable transition systems
- Process versus unfolding semantics for Place/Transition Petri nets
- Synthesis of Nets with Step Firing Policies
- Petri nets and regular processes
- Transition systems, link graphs and Petri nets
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Stratified petri nets
- Analysis of Petri nets and transition systems
- On the Synthesis of Zero-Safe Nets
- Title not available (Why is that?)
- Synthesising elementary net systems with localities
- Process discovery and Petri nets
- Strategies for minimising the synthesised ENL-systems
- Tissue Systems and Petri Net Synthesis
- CTS systems and Petri nets
- On particular class of location-transition Petri nets: state machine
This page was built for publication: PETRI NETS AND STEP TRANSITION SYSTEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032923)
