Free Choice Petri Nets

DOI10.1017/CBO9780511526558zbMath0836.68074OpenAlexW1551214605MaRDI QIDQ4856177

Publication date: 23 November 1995

Full work available at URL: https://doi.org/10.1017/cbo9780511526558

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Maximal and Minimal Dynamic Petri Net Slicing, Generation of synchronizing state machines from a transition system: a region-based approach, Separators in Continuous Petri Nets, Discovering directly-follows complete Petri nets from event data, Separators in continuous Petri nets, Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns, Existence of home states in Petri nets is decidable, Concurrency and objects matter! Disentangling the fabric of real operational processes to create digital twins, Balanced multi-perspective checking of process conformance, REGULAR STATE MACHINES, Sufficient conditions for the marked graph realisability of labelled transition systems, Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues, On liveness and boundedness of asymmetric choice nets, Individuals, populations and fluid approximations: a Petri net based perspective, Reduction rules for reset/inhibitor nets, Linear equations for unordered data vectors in $[D^k\to{}Z^d$], Merged processes: a new condensed representation of Petri net behaviour, Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior, Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets, Petri nets for the design and operation of manufacturing systems, Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN, Markovian dynamics of concurrent systems, On the Reversibility of Live Equal-Conflict Petri Nets, Petri nets for modelling metabolic pathways: a survey, Reachability in live and safe free-choice Petri nets is NP-complete, A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems, A class of composable high level Petri nets, Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account, A New Property of Choice-Free Petri Net Systems, Circular Traffic Queues and Petri’s Cycloids, PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets, Automated Repair of Process Models Using Non-local Constraints, Structural Liveness of Immediate Observation Petri Nets, A Note on Persistent Petri Nets, Blocking a transition in a free choice net and what it tells about its throughput., Decomposition Theorems for Bounded Persistent Petri Nets, Process Discovery Using Integer Linear Programming, A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts, Reduction of Workflow Nets for Generalised Soundness Verification, Untanglings: a novel approach to analyzing concurrent systems, Timed negotiations, A concurrency-preserving translation from time Petri nets to networks of timed automata, Checking system boundedness using ordinary differential equations, Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties, Negotiation as concurrency primitive, An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular, Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks, 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, Free-choice Nets with Home Clusters are Lucent, Sensor placement for distinguishability and single structure observer design in continuous timed Petri nets, Rabin's theorem in the concurrency setting: a conjecture, Periodic scheduling of marked graphs using balanced binary words, Typed event structures and the linear $\pi $-calculus, Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions, Extremal throughputs in free-choice nets, Soundness of workflow nets: classification, decidability, and analysis, Structure and behavior preservation by Petri-net-based refinements in system design, Preserving correctness during business process model configuration, True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures, A note on regular Petri nets, Structure theory of multi-level deterministically synchronized sequential processes, Property-preserving subnet reductions for designing manufacturing systems with shared resources, Inheritance of behavior, Distributed monitoring of concurrent and asynchronous systems, A formal notation and tool for the engineering of CORBA systems, Petri net-based modelling of workflow systems: An overview, Simplified proof of the blocking theorem for free-choice Petri nets, On conditions for the liveness of weakly persistent nets, A survey of siphons in Petri nets, Decompositional Petri Net Reductions, Inheritance of workflows: An approach to tackling problems related to change, Bounded choice-free Petri net synthesis: algorithmic issues, Kleene Theorems for Product Systems, Extensible structural analysis of Petri net product lines, Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond, Refining and verifying regular Petri nets, Grammars Controlled by Special Petri Nets, Combining free choice and time in Petri nets, Soundness-preserving reduction rules for reset workflow nets, A decomposition theorem for finite persistent transition systems, Towards efficient verification of population protocols, Deficiency Zero Petri Nets and Product Form, Une nouvelle transformation des réseaux de Petri généralisés : L'abstraction généralisée, Modular Modelling of Software Product Lines with Feature Nets, Dynamic Slicing Techniques for Petri Nets, Unnamed Item, Connectivity of workflow nets: The foundations of stepwise verification, Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable, Target-oriented Petri Net Synthesis, A Theory of Distributed Markov Chains, Introduction to Petri Nets, Observable liveness of Petri nets, Probabilistic π-Calculus and Event Structures, Negotiations and Petri Nets, Kleene Theorems for Synchronous Products with Matching, Analysis issues in Petri nets with inhibitor arcs, Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions, Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory, Building reduced Petri net models of discrete manufacturing systems, Computing parameterized invariants of parameterized Petri nets, Synthesis of (choice-free) reset nets, Synthesis of Petri nets with restricted place-environments: classical and parameterized, Efficient algorithms for three reachability problems in safe Petri nets