scientific article; zbMATH DE number 1302043
From MaRDI portal
Publication:4247286
zbMATH Open0926.68083MaRDI QIDQ4247286FDOQ4247286
Authors: Jörg Desel, Wolfgang Reisig 
Publication date: 16 June 1999
Title of this publication is not available (Why is that?)
Recommendations
- On the semantics of place/transition Petri nets
- scientific article; zbMATH DE number 3922334
- Petri nets
- Petri-Netze
- scientific article; zbMATH DE number 979001
- PETRI NETS AND STEP TRANSITION SYSTEMS
- Transition systems, link graphs and Petri nets
- scientific article; zbMATH DE number 60121
- Process versus unfolding semantics for Place/Transition Petri nets
- A process calculus for expressing finite place/transition Petri nets
Cited In (40)
- Title not available (Why is that?)
- Interval traces with mutex relation
- Structure theory of Petri nets
- Title not available (Why is that?)
- Small vertex cover makes Petri net coverability and boundedness easier
- On Interval Semantics of Inhibitor and Activator Nets
- On the semantics of place/transition Petri nets
- Petri nets properties related to the unboundness and analyzed using coverability multigraph
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
- Firing partial orders in a Petri net
- Localities in systems with a/sync communication
- Structure and behavior preservation by Petri-net-based refinements in system design
- Title not available (Why is that?)
- Discovering directly-follows complete Petri nets from event data
- Step coverability algorithms for communicating systems
- Executability of scenarios in Petri nets
- Title not available (Why is that?)
- Decidability and complexity of Petri nets with unordered data
- Question-guided stubborn set methods for state properties
- On the expressiveness of mobile synchronizing Petri nets
- Interval semantics for Petri nets with inhibitor arcs
- Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen.
- A study on team bisimulation and H-team bisimulation for BPP nets
- Petri net reactive modules
- Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
- Combining free choice and time in Petri nets
- Petri nets with name creation for transient secure association
- Title not available (Why is that?)
- Stop-transitions of Petri nets
- Transformation of variants of Petri nets into context-dependent fusion grammars
- Causal Semantics for BPP Nets with Silent Moves
- Robustness of deadlock control for a class of Petri nets with unreliable resources
- Language representability of finite P/T nets
- On interleaving behaviour of PT-nets
- Analysis of Petri nets and transition systems
- Unifying Petri nets with restricted occurrence rule using partial algebra
- Title not available (Why is that?)
- Modeling concurrency with interval traces
- Title not available (Why is that?)
- On the Analysis of Petri Nets and their Synthesis from Process Languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247286)
