PPTL specification mining based on LNFG
type: Item
instance of: scholarly article
title: PPTL specification mining based on LNFG
author: Xinya Ning
author: Nan Zhang
author: Zhenhua Duan
author: Cong Tian
published in: Theoretical Computer Science
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7605947
zbMATH Keywords: specification mining
zbMATH Keywords: temporal logic
zbMATH Keywords: formal specification
zbMATH Keywords: labeled normal form graph
describes a project that uses: Texada
describes a project that uses: PPTLMiner
describes a project that uses: PPTL_SPIN
describes a project that uses: DynaMine
describes a project that uses: SPIN
MaRDI profile type: Publication
full work available at URL: j.tcs.2022.09.032
OpenAlex ID: W4297498026
cites work: Temporal logic specification mining of programs
cites work: Expressiveness of propositional projection temporal logic with star
cites work: A decision procedure for propositional projection temporal logic with infinite models
cites work: A canonical form based decision procedure and model checking approach for propositional projection temporal logic
cites work: Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
cites work: Checking satisfiability of two-dimensional logic PPTL\(^{\mathrm{SL}}\)
cites work: PPTL\_SPIN: a SPIN based model checker for propositional projection temporal logic
cites work: Bounded Model Checking for Propositional Projection Temporal Logic
cites work: Model checking Petri nets with MSVL
cites work: A complete proof system for propositional projection temporal logic
DOI: 10.1016/J.TCS.2022.09.032
description: scientific article; zbMATH DE number 7605947