Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Compiling Real-Time Specifications into Extended Automata
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
A practical technique for bounding the time between events in concurrent real-time systems
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
Comparing different approaches for specifying and verifying real-time systems
RTOSS '93 Proceedings of the tenth IEEE workshop on Real-time operating systems and software
Analysis of real-time programs with simple time Petri nets
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Efficient Verification of Parallel Real-Time Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A Petri-net-based approach to real-time program analysis
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset
Automated Software Engineering
Improving the Verification of Timed Systems Using Influence Information
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
On Stubborn Sets in the Verification of Linear Time Temporal Properties
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Handbook of automated reasoning
On Stubborn Sets in the Verification of Linear Time Temporal Properties
Formal Methods in System Design
| Hi-index | 0.00 |
The stubborn-set method attempts to reduce the number of states thatmust be explicitly enumerated during reachability analysis of aconcurrent system, while preserving crucial concurrency properties inthe reduced state space. Here we extend the method to the analysis ofcertain timed models. We also prove that timing properties ofinterest, such as minimum and maximum delays between events, arepreserved in the reduced model. Finally, we report on someexperimental results that we have obtained with our extension. Theseresults show that real-time stubborn sets can often providesignificant reductions in state space size.