2007
DOI: 10.1007/s00236-007-0062-z
|View full text |Cite
|
Sign up to set email alerts
|

A decision procedure for propositional projection temporal logic with infinite models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
53
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 129 publications
(54 citation statements)
references
References 23 publications
0
53
0
Order By: Relevance
“…Normal forms are useful in constructing LNFGs [22,25]. In the following, we briefly present the definition of normal form as well as some relevant concepts.…”
Section: Normal Form Of Pptlmentioning
confidence: 99%
See 2 more Smart Citations
“…Normal forms are useful in constructing LNFGs [22,25]. In the following, we briefly present the definition of normal form as well as some relevant concepts.…”
Section: Normal Form Of Pptlmentioning
confidence: 99%
“…An important conclusion is that any PPTL formula can be transformed to its normal form. Details of the proofs and the algorithm for transforming a PPTL formula into its normal form can be found in [25].…”
Section: Normal Form Of Pptlmentioning
confidence: 99%
See 1 more Smart Citation
“…Compared with ITL [11,18,19], the additional operator denoted as "; " in RASL is appended for the description of time constraints between intervals.…”
Section: Raslmentioning
confidence: 99%
“…Reference [18] gives a data structure called normal form graph (NFG) as well as a procedure called PRO(P) to construct the NFG model denoted as for an ASL formula . Thus, an ASL model checking algorithm was obtained in [18]. Based on this work, we can obtain a RASL model checking algorithm and its intrusion detection algorithm.…”
Section: Rasl Model Checking Algorithm and Intrusion Detection Algorithmmentioning
confidence: 99%