Free Choice Petri Nets

DOI10.1017/CBO9780511526558zbMath0836.68074MaRDI QIDQ4856177

Publication date: 23 November 1995

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

REGULAR STATE MACHINES, Unnamed Item, Kleene Theorems for Product Systems, Unnamed Item, Refining and verifying regular Petri nets, Une nouvelle transformation des réseaux de Petri généralisés : L'abstraction généralisée, Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties, Structure theory of multi-level deterministically synchronized sequential processes, Inheritance of behavior, Petri net-based modelling of workflow systems: An overview, Inheritance of workflows: An approach to tackling problems related to change, Deficiency Zero Petri Nets and Product Form, Soundness of workflow nets: classification, decidability, and analysis, Petri nets for modelling metabolic pathways: a survey, Structure and behavior preservation by Petri-net-based refinements in system design, Connectivity of workflow nets: The foundations of stepwise verification, Building reduced Petri net models of discrete manufacturing systems, Reduction rules for reset/inhibitor nets, Merged processes: a new condensed representation of Petri net behaviour, Typed event structures and the linear \(\pi \)-calculus, Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions, Preserving correctness during business process model configuration, A note on regular Petri nets, Simplified proof of the blocking theorem for free-choice Petri nets, On conditions for the liveness of weakly persistent nets, Soundness-preserving reduction rules for reset workflow nets, A decomposition theorem for finite persistent transition systems, Reachability in live and safe free-choice Petri nets is NP-complete, Petri nets for the design and operation of manufacturing systems, Blocking a transition in a free choice net and what it tells about its throughput., Analysis issues in Petri nets with inhibitor arcs, Property-preserving subnet reductions for designing manufacturing systems with shared resources, Distributed monitoring of concurrent and asynchronous systems, On liveness and boundedness of asymmetric choice nets, True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures, Refinement of Synchronizable Places with Multi-workflow Nets, Finding a Witness Path for Non-liveness in Free-Choice Nets, On Parametric Steady State Analysis of a Generalized Stochastic Petri Net with a Fork-Join Subnet, Modular Modelling of Software Product Lines with Feature Nets, A Note on Persistent Petri Nets, Decomposition Theorems for Bounded Persistent Petri Nets, Process Discovery Using Integer Linear Programming, Decompositional Petri Net Reductions, Grammars Controlled by Special Petri Nets