Characterization of Admissible Marking Sets in Petri Nets With Conflicts and Synchronizations

DOI10.1109/TAC.2016.2585647MaRDI QIDQ5282378zbMATH OpenOpenAlexFDO

Authors Ziyue Ma, Zhiwu Li, Alessandro Giua

Publication date 27 July 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2016.2585647

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Discrete event control/observation systems (93C65)

Cited in

(7)

• Design of supervisors for linear marking specifications in labeled Petri nets
• Deadlock analysis and control using Petri net decomposition techniques
• An improved approach for marking optimization of timed weighted marked graphs
• Petri net controllers for generalized mutual exclusion constraints with floor operators
• Optimal sensor selection for diagnosability enforcement of discrete event systems using labeled Petri net
• Monitor-based synthesis in enforcing disjunctive generalised mutual exclusion constraints
• Deadlock and liveness characterization for a class of generalized Petri nets

This page was built for publication: Characterization of Admissible Marking Sets in Petri Nets With Conflicts and Synchronizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282378)