Synchronizing sequences on a class of unbounded systems using synchronized Petri nets

DOI10.1007/s10626-016-0225-6zbMath1333.93170OpenAlexW4301491366MaRDI QIDQ262433

Alessandro Giua, Isabel Demongodin, Marco Pocci, Norbert Giambiasi

Publication date: 29 March 2016

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

Full work available at URL: https://doi.org/10.1007/s10626-016-0225-6

zbMATH Keywords

coverability graphsynchronized Petri netssynchronizing sequencestesting theoryunbounded nets

Mathematics Subject Classification ID

Applications of graph theory (05C90) Discrete event control/observation systems (93C65) Applications of graph theory to circuits and networks (94C15)

Related Items

Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis, Petri net controllers for generalized mutual exclusion constraints with floor operators, Correction to: ``Synchronizing sequences on a class of unbounded systems using synchronized Petri nets, Active Diagnosis for Switched Systems Using Mealy Machine Modeling, Test-based diagnosis of faults in data exchange addressing in computer systems using parallel model, Synchronizing sequences on a class of unbounded systems using synchronized Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
• Boundedness undecidability for synchronized nets
• Synchronization
• Parallel program schemata
• Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
• ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS
• The Complexity of the Finite Containment Problem for Petri Nets
• Discrete, Continuous, and Hybrid Petri Nets