PPTL specification mining based on LNFG

DOI10.1016/j.tcs.2022.09.032OpenAlexW4297498026MaRDI QIDQ2089678

Zhenhua Duan, Cong Tian, Xinya Ning, Nan Zhang

Publication date: 24 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.032

zbMATH Keywords

formal specificationtemporal logicspecification mininglabeled normal form graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• SPIN
• DynaMine
• Texada
• PPTLMiner
• PPTL_SPIN

Cites Work

• A complete proof system for propositional projection temporal logic
• A canonical form based decision procedure and model checking approach for propositional projection temporal logic
• PPTL\_SPIN: a SPIN based model checker for propositional projection temporal logic
• Temporal logic specification mining of programs
• Model checking Petri nets with MSVL
• Expressiveness of propositional projection temporal logic with star
• A decision procedure for propositional projection temporal logic with infinite models
• Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
• Bounded Model Checking for Propositional Projection Temporal Logic
• Unnamed Item

This page was built for publication: PPTL specification mining based on LNFG