For the most recent entries see the Petri Nets Newsletter.

Partial order reductions for checking branching properties of time Petri nets.

Penczek, W.

In: Burkhard, H.-D.; Czaja, L.; Skowron, A.; Starke, P.: Report No. 140: Proceedings of the workhop on Concurrency, Specification and Programming, Oct 9-11, 2000, pages 189-202. Berlin: Humboldt-University, 2000.

Abstract: The paper deals with verification of untimed branching time properties of Time Petri Nets. The atomic variant of the geometric region method for preserving properties of CTL* and ACTL* is improved. Then, it is shown, for the first time, how to apply the partial order reduction method to deal with next-time free branching properties of Time Petri Nets. The above two results are combined offering an efficient method for model checking of ACTL*-x and CTL*-x properties of Time Petri Nets.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography