Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions
From MaRDI portal
Publication:3618711
DOI10.1007/11767589_18zbMath1234.68306MaRDI QIDQ3618711
Jin Young Choi, Spyros A. Reveliotis
Publication date: 2 April 2009
Published in: Petri Nets and Other Models of Concurrency - ICATPN 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11767589_18
90C11: Mixed integer programming
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Reversing Unbounded Petri Nets, A branch and bound approach for the design of decentralized supervisors in Petri net models, Identification of Petri nets from knowledge of their language, Solving the Problem of Forbidden States in Discrete Event Systems: A Novel Systematic Method for Reducing the Number of Control Places, Controller Synthesis with Highly Simplified Linear Constraints