Petri nets: an introduction
Automatically validating temporal safety properties of interfaces
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Alternating-time temporal logic
Journal of the ACM (JACM)
Timed Petri Nets and Temporal Linear Logic
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach (Studies in Computational Intelligence)
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Verification of the TESLA protocol in MCMAS-X
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Logic for automated mechanism design: a progress report
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
Alternating-time Temporal Logic (ATL) is the natural specification language for the open system, which has a strategy to reach a certain state. But the semantics for ATL is not studied sufficiently. In this paper, we define Timed Petri Nets (TPN), where time is associated with tokens, transitions, arcs and places. TPN is taken as the semantic description for ATL, the representation of time constraints is interpreted for ATL. We obtain a natural relationship between ATL and TPN. commonality, variability, binding time, structural relations are taken into account in this method. An illustrative example for verifying safety protocol is addressed based on timed Petri nets and ATL.