Refining and verifying regular Petri nets
From MaRDI portal
Publication:5451165
DOI10.1080/00207720701621959zbMath1138.93036OpenAlexW2008846552MaRDI QIDQ5451165
Publication date: 18 March 2008
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720701621959
Programming involving graphs or networks (90C35) Design techniques (robust design, computer-aided design, etc.) (93B51) Discrete event control/observation systems (93C65)
Related Items (2)
On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems ⋮ Controllability of control and mixture weakly dependent siphons in S3PR
Cites Work
- Structure and behavior preservation by Petri-net-based refinements in system design
- A method for stepwise refinement and abstraction of Petri nets
- Analysis of Petri nets by stepwise refinements
- A review of synthesis techniques for Petri nets with applications to automated manufacturing systems
- On supervisory policies that enforce liveness in a class of completely controlled Petri nets obtained via refinement
- Free Choice Petri Nets
This page was built for publication: Refining and verifying regular Petri nets
