A Generalized Timed Petri Net Model for Performance Analysis
IEEE Transactions on Software Engineering
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
A Semantics Based Verification Tool for Finite State Systems
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Putting Time into Proof Outlines
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Timing Requirements for Time-Driven Systems Using Augmented Petri Nets
IEEE Transactions on Software Engineering
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
IEEE Transactions on Software Engineering
TAPAAL 2.0: integrated development environment for timed-arc petri nets
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
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, Lynch and Shavit's mutual exclusion protocol and a producer-consumer protocol. We also used the tool to extract finite-state abstractions of these protocols.