scientific article; zbMATH DE number 1302043
From MaRDI portal
Publication:4247286
zbMath0926.68083MaRDI QIDQ4247286
Publication date: 16 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Petri nets properties related to the unboundness and analyzed using coverability multigraph ⋮ Language Representability of Finite P/T Nets ⋮ Question-guided stubborn set methods for state properties ⋮ Transformation of variants of Petri nets into context-dependent fusion grammars ⋮ On Interval Semantics of Inhibitor and Activator Nets ⋮ Localities in systems with a/sync communication ⋮ Discovering directly-follows complete Petri nets from event data ⋮ Step coverability algorithms for communicating systems ⋮ Small vertex cover makes Petri net coverability and boundedness easier ⋮ Robustness of deadlock control for a class of Petri nets with unreliable resources ⋮ Interval semantics for Petri nets with inhibitor arcs ⋮ Modeling concurrency with interval traces ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ 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. ⋮ Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra ⋮ Structure and behavior preservation by Petri-net-based refinements in system design ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Petri net reactive modules ⋮ Petri nets with name creation for transient secure association ⋮ Combining free choice and time in Petri nets ⋮ Executability of scenarios in Petri nets ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ On the Analysis of Petri Nets and their Synthesis from Process Languages ⋮ Stop-transitions of Petri Nets* ⋮ On the Expressiveness of Mobile Synchronizing Petri Nets ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves ⋮ Firing partial orders in a Petri net
This page was built for publication:
