Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
From MaRDI portal
Recommendations
Cites work
- Boundedness undecidability for synchronized nets
- Discrete, Continuous, and Hybrid Petri Nets
- scientific article; zbMATH DE number 2040899 (Why is no real title available?)
- Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning
- On the efficient computation of the minimal coverability set of Petri nets
- Parallel program schemata
- Synchronization
- Synchronization and stability of finite automata
- Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
- The Complexity of the Finite Containment Problem for Petri Nets
Cited in
(8)- Test-based diagnosis of faults in data exchange addressing in computer systems using parallel model
- Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis
- Correction to: ``Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
- Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
- Petri net controllers for generalized mutual exclusion constraints with floor operators
- scientific article; zbMATH DE number 4087033 (Why is no real title available?)
- Active diagnosis for switched systems using Mealy machine modeling
- scientific article; zbMATH DE number 975327 (Why is no real title available?)
This page was built for publication: Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262433)