Control of safe ordinary Petri nets using unfolding

DOI10.1007/S10626-005-4057-ZzbMath1103.68082OpenAlexW1995324690MaRDI QIDQ816699

Alessandro Giua, Xiaolan Xie

Publication date: 23 February 2006

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://hal-emse.ccsd.cnrs.fr/emse-00449397/file/XX-DEDS-TA-15-original.pdf

zbMATH Keywords

Petri netsdeadlock avoidanceunfoldingforbidden markings

Mathematics Subject Classification ID

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

Related Items (6)

Controller Synthesis with Highly Simplified Linear Constraints ⋮ Unnamed Item ⋮ Trellis processes: a compact representation for runs of concurrent systems ⋮ Reduction of constraints for controller synthesis based on safe Petri nets ⋮ Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems ⋮ Control of safe ordinary Petri nets using unfolding

Uses Software

• REACH

Cites Work

• Unnamed Item
• Control of safe ordinary Petri nets using unfolding
• Fault detection and diagnosis in distributed systems: An approach by partially stochastic Petri nets
• A technique of state space search based on unfolding
• An improvement of McMillan's unfolding algorithm
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• Markov nets: probabilistic models for distributed and concurrent systems
• Diagnosis of asynchronous discrete-event systems: a net unfolding approach
• Liveness-enforcing supervision of bounded ordinary Petri nets using partial order methods
• Counterexamples to “Liveness-Enforcing Supervision of Bounded Ordinary Petri Nets Using Partial-Order Methods”

This page was built for publication: Control of safe ordinary Petri nets using unfolding