Understanding Petri Nets
From MaRDI portal
Publication:4911790
DOI10.1007/978-3-642-33278-4zbMath1278.68222OpenAlexW2503470518MaRDI QIDQ4911790
Publication date: 20 March 2013
Full work available at URL: https://doi.org/10.1007/978-3-642-33278-4
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 (58)
Concurrency and objects matter! Disentangling the fabric of real operational processes to create digital twins ⋮ Petri nets properties related to the unboundness and analyzed using coverability multigraph ⋮ Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Model checking Petri nets with names using data-centric dynamic systems ⋮ Unnamed Item ⋮ Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior ⋮ Data and process resonance. Identifier soundness for models of information systems ⋮ Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets ⋮ Reversible computation in nets with bonds ⋮ Verification of finite-state machines: a distributed approach ⋮ Solving high-level Petri games ⋮ Transformation of variants of Petri nets into context-dependent fusion grammars ⋮ Signal set tissue systems and overlapping localities ⋮ PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ High-level representation of benchmark families for Petri games ⋮ Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem ⋮ Rough sets: past, present, and future ⋮ Just testing ⋮ Efficient modelling of yeast cell cycles based on multisite phosphorylation using coloured hybrid Petri nets with marking-dependent arc weights ⋮ Maximal and Minimal Dynamic Petri Net Slicing ⋮ Compositional Specification in Rewriting Logic ⋮ Reversing Steps in Petri Nets ⋮ A kinetic theory model for the energy-demand management in a microgrid-macrogrid network ⋮ Describing Behavior of Processes with Many-to-Many Interactions ⋮ Untanglings: a novel approach to analyzing concurrent systems ⋮ Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns ⋮ Correctness Notions for Petri Nets with Identifiers ⋮ Deciding Structural Liveness of Petri Nets ⋮ Model-based fault identification of discrete event systems using partially observed Petri nets ⋮ Unnamed Item ⋮ Team equivalences for finite-state machines with silent moves ⋮ Automatic construction of systems of distributed components from nested Petri nets models ⋮ Consensus formation in networks with neighbor-dependent synergy and observer effect ⋮ Unnamed Item ⋮ Associative composition of components with double-sided interfaces ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ Reversible session-based pi-calculus ⋮ Composition colored Petri nets for the refinement of reaction-based models ⋮ Free-choice Nets with Home Clusters are Lucent ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Unnamed Item ⋮ Complexity of the deadlock problem for Petri nets modeling resource allocation systems ⋮ A survey of siphons in Petri nets ⋮ Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait ⋮ An extension of the taxonomy of persistent and nonviolent steps ⋮ Generating all minimal Petri net unsolvable binary words ⋮ Presynthesis of bounded choice-free or fork-attribution nets ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ Characterising Petri Net Solvable Binary Words ⋮ Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable ⋮ Acyclic and Cyclic Reversing Computations in Petri Nets ⋮ Conditions for Petri Net Solvable Binary Words ⋮ Investigating Reversibility of Steps in Petri Nets ⋮ Computing parameterized invariants of parameterized Petri nets ⋮ Firing partial orders in a Petri net
This page was built for publication: Understanding Petri Nets
