Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Static Analysis and Dynamic Steering of Time-Dependent Systems
IEEE Transactions on Software Engineering
Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets
IEEE Transactions on Software Engineering
Model Checking of Real-Time Reachability Properties Using Abstractions
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Interval Timed Coloured Petri Nets and their Analysis
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Time Stream Petri Nets: A Model for Timed Multimedia Information
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
A State Graph Manipulator Tool for Real-Time System Specification and Verification
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
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
Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Towards Building the State Class Graph of the TSPN Model
Fundamenta Informaticae
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)
On-the-fly TCTL model checking for time Petri nets
Theoretical Computer Science
Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs
Discrete Event Dynamic Systems
Achieving multi-tenanted business processes in SaaS applications
WISE'11 Proceedings of the 12th international conference on Web information system engineering
Model checking of time Petri nets
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Zenoness detection and timed model checking for real time systems
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
Theoretical Computer Science
Towards Building the State Class Graph of the TSPN Model
Fundamenta Informaticae
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
On combining the ready sets with the covering steps methods
International Journal of Critical Computer-Based Systems
| Hi-index | 5.23 |
This paper aims at applying the CTL* model checking method to the time Petri net (TPN) model. We show here how to contract its generally infinite state space into a graph that captures all its CTL* properties. This graph, called atomic state class graph (ASCG), is finite if and only if, the model is bounded. Our approach is based on a partition refinement technique, similarly to what is proposed in [Berthomieu, Vernadat, State class constructions for branching analysis of time Petri nets, Lecture Notes in Computer Science, vol. 2619, 2003; Yoneda, Ryuba, CTL model checking of time Petri nets using geometric regions, IEICE Trans. Inf. Syst. E99-D(3) (1998)]. In such a technique, an intermediate abstraction (contraction) of the TPN state space is first built, then refined until CTL* properties are restored. Our approach improves the construction of the ASCG in two ways. The first way deals with speeding up the refinement process by using a much more compact intermediate contraction of the TPN state space than those used in [Berthomieu, Vernadat, State class constructions for branching analysis of time Petri nets, Lecture Notes in Computer Science, vol. 2619, 2003; Yoneda, Ryuba, CTL model checking of time Petri nets using geometric regions, IEICE Trans. Inf. Syst. E99-D(3) (1998)]. The second way deals with computing each ASCG node in O(n2) instead of O(n3), n being the number of transitions enabled at the node. Experimental results have shown that our improvements have a good impact on performances.