scientific article; zbMATH DE number 1302048
From MaRDI portal
Publication:4247291
zbMath0926.68088MaRDI QIDQ4247291
Eric Badouel, Philippe Darondeau
Publication date: 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (44)
The synthesis of Petri nets from path-automatic specifications ⋮ Tissue Systems and Petri Net Synthesis ⋮ Step semantics of Boolean nets ⋮ Synthesis of Petri Nets with Whole-Place Operations and Localities ⋮ Computationally improved optimal control methodology for linear programming problems of flexible manufacturing systems ⋮ Signal set tissue systems and overlapping localities ⋮ On the Synthesis of Zero-Safe Nets ⋮ Reversing Steps in Petri Nets ⋮ A Symbolic Algorithm for the Synthesis of Bounded Petri Nets ⋮ Process Discovery Using Integer Linear Programming ⋮ Real time identification of discrete event systems using Petri nets ⋮ Deadlock analysis and control using Petri net decomposition techniques ⋮ Discovery, Verification and Conformance of Workflows with Cancellation ⋮ Identification of Petri nets from knowledge of their language ⋮ Distributed Control of Discrete-Event Systems: A First Step ⋮ Aggregating Causal Runs into Workflow Nets ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Discovering Block-Structured Process Models from Incomplete Event Logs ⋮ Synthesis of Persistent Systems ⋮ Synthesis and reengineering of persistent systems ⋮ Regions of Petri nets with a/sync connections ⋮ Partial Order Semantics of Types of Nets ⋮ Editorial: Deadlock analysis and control in resource allocation systems ⋮ A survey of siphons in Petri nets ⋮ Think-globally-act-locally approach with weighted arcs to the synthesis of a liveness-enforcing supervisor for generalized Petri nets modeling FMSs ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Applying regions ⋮ Enhancing discovered processes with duplicate tasks ⋮ Does My Service Have Partners? ⋮ Deciding Substitutability of Services with Operating Guidelines ⋮ Construction of Process Models from Example Runs ⋮ Presynthesis of bounded choice-free or fork-attribution nets ⋮ The Power of Prime Cycles ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ Hasse Diagram Generators and Petri Nets ⋮ Synthesis of Nets with Step Firing Policies ⋮ Discovering Object-centric Petri Nets ⋮ Synthesising elementary net systems with localities ⋮ k-Bounded Petri Net Synthesis from Modal Transition Systems. ⋮ State space axioms for T-systems ⋮ An algebraic model of observable properties in distributed systems ⋮ Fault model identification and synthesis in Petri nets ⋮ Investigating Reversibility of Steps in Petri Nets ⋮ Topics in region theory and synthesis problems
This page was built for publication:
