Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Representing and modeling digital circuits
Representing and modeling digital circuits
Efficient Verification of Parallel Real–Time Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Towards an Efficient Algorithm for Unfolding Petri Nets
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
State space computation and analysis of Time Petri Nets
Theory and Practice of Logic Programming
CTL* model checking for time Petri nets
Theoretical Computer Science
Partial Order Reduction for Detecting Safety and Timing Failures of Timed Circuits
IEICE - Transactions on Information and Systems
State class constructions for branching analysis of time Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.00 |
We consider here time Petri nets (TPN model). We first propose an abstraction to its generally infinite state space which preserves linear properties of the TPN model. Comparing with TPN abstractions proposed in the literature, our abstraction produces graphs which are both smaller and faster to compute. In addition, our characterization of agglomerated states allows a significant gain in space. Afterwards, we show how to apply Yoneda's partial order reduction technique to construct directly reduced graphs useful to verify LTL$_{-X}$ properties of the model. Using our approach, both time and space complexities are reduced. Finally, we propose a time extension for Büchi automata which is useful to model checking timed linear properties of the model, using the abstraction proposed here.