A CTL* Model Checker for Petri Nets

被引:4
作者
Amparore, Elvio Gilberto
Donatelli, Susanna
Galla, Francesco
机构
来源
APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY (PETRI NETS 2020) | 2020年 / 12152卷
关键词
D O I
10.1007/978-3-030-51831-8_21
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This tool paper describes RGMEDD*, a CTL* model checker that computes the set of states (sat-sets) of a Petri net that satisfy a CTL* formula. The tool can be used as a stand-alone program or from the GreatSPN graphical interface. The tool is based on the decision diagram library Meddly, it uses Spot to translate (sub)formulae into B <spacing diaeresis>uchi automata and a variation of the Emerson-Lei algorithm to compute the sat-sets. Correctness has been assessed based on the Model Checking Context 2018 results (for LTL and CTL queries), the sat-set computation of GreatSPN (for CTL) and LTSmin (for LTL), and the mu-calculus model checker of LTSmin for proper CTL* formulae (using a translator from CTL* to mu-calculus available in LTSmin). As far as we know, RGMEDD* is the only available Buchi-based CTL* model checker.
引用
收藏
页码:403 / 413
页数:11
相关论文
共 26 条
  • [21] Pnueli A., 1977, 18th Annual Symposium on Foundations of Computer Science, P46, DOI 10.1109/SFCS.1977.32
  • [22] Sylvan: multi-core framework for decision diagrams
    van Dijk, Tom
    van de Pol, Jaco
    [J]. INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2017, 19 (06) : 675 - 696
  • [23] Vardi M. Y., 1996, Logics for Concurrency. Structure versus Automata, P238
  • [24] REASONING ABOUT INFINITE COMPUTATIONS
    VARDI, MY
    WOLPER, P
    [J]. INFORMATION AND COMPUTATION, 1994, 115 (01) : 1 - 37
  • [25] Visser W., 1998, 4 INT SPIN WORKSHOP
  • [26] Wang C., 2006, ABSTRACTION REFINEME