2004 | OriginalPaper | Chapter
Forward Reachability Analysis of Timed Petri Nets
Authors : Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, Aletta Nylén
Published in: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We consider verification of safety properties for concurrent real-timed systems modelled as timed Petri nets, by performing symbolic forward reachability analysis. We introduce a formalism, called region generators for representing sets of markings of timed Petri nets. Region generators characterize downward closed sets of regions, and provide exact abstractions of sets of reachable states with respect to safety properties. We show that the standard operations needed for performing symbolic reachability analysis are computable for region generators. Since forward reachability analysis is necessarily incomplete, we introduce an acceleration technique to make the procedure terminate more often on practical examples. We have implemented a prototype for analyzing timed Petri nets and used it to verify a parameterized version of Fischer’s protocol and a producer-consumer protocol. We also used the tool to extract finite-state abstractions of these protocols.