Symbolic model checking for real-time systems
Information and Computation
Model checking
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
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
Analysis of Event-Driven Real-Time Systems with Time Petri Nets: A Translation-Based Approach
DIPES '02 Proceedings of the IFIP 17th World Computer Congress - TC10 Stream on Distributed and Parallel Embedded Systems: Design and Analysis of Distributed Embedded Systems
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
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
Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Nordic Journal of Computing
Time Constraints Verification Methods Based on Time Petri Nets
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Much Compact Time Petri Net State Class Spaces Useful to Restore CTL* Properties
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
CTL* model checking for time Petri nets
Theoretical Computer Science
On-the-fly TCTL model checking for Time Petri Nets using state class graphs
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Timing Requirements for Time-Driven Systems Using Augmented Petri Nets
IEEE Transactions on Software Engineering
Structural Translation from Time Petri Nets to Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper, we consider the time Petri net model (TPN model) and show how to detect zenoness using the state class method. Zenoness is a situation which suggests that an infinity of actions may take place in a finite amount of time. This behavior is often considered as pathological since it violates a fundamental requirement for timed systems for they cannot be infinitely fast. Models violating this property are called zeno. We state a necessary and sufficient condition for T-safe TPNs to be zeno and derive an algorithm to verify zenoness in the case of bounded TPN models. We also adapt a model checking approach to verify on-the-fly a subset of TCTL properties while taking into account zeno behaviors.