Stubborn Sets for Time Petri Nets

  title={Stubborn Sets for Time Petri Nets},
  author={Hanifa Boucheneb and Kamel Barkaoui},
  journal={ACM Trans. Embedded Comput. Syst.},
The main limitation of the verification approaches based on state enumeration is the state explosion problem. The partial order reduction techniques aim at attenuating this problem by reducing the number of transitions to be fired from each state while preserving properties of interest. Among the reduction techniques proposed in the literature, this article considers the stubborn set method of Petri nets and investigates its extension to time Petri nets. It establishes some useful sufficient… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-8 of 8 references

Timed state space exploration using POSETs

IEEE Trans. on CAD of Integrated Circuits and Systems • 2000
View 7 Excerpts
Highly Influenced

Efficient State Space Search for Time Petri Nets

Electr. Notes Theor. Comput. Sci. • 1998
View 5 Excerpts
Highly Influenced

Efficient Verification of Parallel Real-Time Systems

Formal Methods in System Design • 1997
View 8 Excerpts
Highly Influenced

A Stubborn Attack On State Explosion

CAV • 1990
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…