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

DOI10.1109/TAC.2016.2585647zbMath1366.93356OpenAlexW2461900131MaRDI QIDQ5282378

Zhiwu Li, Ziyue Ma, 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

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

Related Items (5)

Petri net controllers for generalized mutual exclusion constraints with floor operators ⋮ Deadlock analysis and control using Petri net decomposition techniques ⋮ An improved approach for marking optimization of timed weighted marked graphs ⋮ Design of supervisors for linear marking specifications in labeled Petri nets ⋮ 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