Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Efficient Verification of Parallel Real–Time Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
On Combining the Persistent Sets Method with the Covering Steps Graph Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
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 study of the recoverability of computing systems.
A study of the recoverability of computing systems.
CTL* model checking for time Petri nets
Theoretical Computer Science
Lower and upper bounds in zone-based abstractions of timed automata
International Journal on Software Tools for Technology Transfer (STTT)
Partial Order Reduction for Detecting Safety and Timing Failures of Timed Circuits
IEICE - Transactions on Information and Systems
Improving state class constructions for CTL* model checking of time Petri nets
International Journal on Software Tools for Technology Transfer (STTT)
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Covering Steps Graphs of Time Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
TCTL Model Checking of Time Petri Nets
Journal of Logic and Computation
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
Model checking bounded prioritized time Petri nets
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
On interleaving in timed automata
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.00 |
The main problem of verification techniques based on exploration of (reachable) state space is the state explosion problem. In timed models, abstract states reached by different interleavings of the same set of transitions are, in general, different and their union is not necessarily an abstract state. To attenuate this state explosion, it would be interesting to reduce the redundancy caused by the interleaving semantics by agglomerating all these abstract states whenever their union is an abstract state. This article considers the time Petri net model and establishes some sufficient conditions that ensure that this union is an abstract state. In addition, it proposes a procedure to compute this union without computing beforehand intermediate abstract states. Finally, it shows how to use this result to improve the reachability analysis.