Author:
Amparore Elvio Gilberto,Donatelli Susanna,Gallà Francesco
Abstract
Model-checking of temporal logic formulae is a widely used technique for the verification of systems. CTL$^*$ is a temporal logic that allows to consider an intermix of both branching behaviours (like in CTL) and linear behaviours (LTL), overcoming the limitations of LTL (that cannot express “possibility”) and CTL (cannot fully express fairness). Nevertheless CTL$^*$ model-checkers are uncommon. This paper presents (1) the algorithms for a fully symbolic automata-based approach for CTL$^*$, and (2) their implementation in the open-source tool starMC, a CTL$^*$ model checker for systems specified as Petri nets. Testing has been conducted on thousands of formulas over almost a hundred models. The experiments show that the fully symbolic automata-based approach of starMC can compute the set of states that satisfy a CTL$^*$ formula for very large models (non trivial formulas for state spaces larger than 10480 states are evaluated in less than a minute).
Reference59 articles.
1. The application of Petri nets to workflow management;Aalst;Journal of Circuits, Systems, and Computers,1998
2. Efficient model checking of the stochastic logic CSLTA;Amparore;Performance Evaluation,2018a
3. A new GreatSPN GUI for GSPN editing and CSLTA model checking;Amparore,2014
4. 30 Years of GreatSPN;Amparore,2016
5. (Stochastic) model checking in GreatSPN;Amparore,2014
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts;Automated Technology for Verification and Analysis;2023
2. A Truly Symbolic Linear-Time Algorithm for SCC Decomposition;Tools and Algorithms for the Construction and Analysis of Systems;2023