The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Using encryption for authentication in large networks of computers
Communications of the ACM
Symbolic Model Checking
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Complete Proof Systems for First Order Interval Temporal Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Reasoning about digital circuits
Reasoning about digital circuits
Decidability of propositional projection temporal logic with infinite models
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Semantics of framed temporal logic programs
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Complexity of propositional projection temporal logic with star†
Mathematical Structures in Computer Science
Generalized Russian Cards Problem
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Propositional projection temporal logic, Büchi automata and ω-regular expressions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
UML statecharts' PTL formal semantics
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
An improved decision procedure for propositional projection temporal logic
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Alternating interval based temporal logics
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A transformation from PPTL to S1S
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Expressiveness of propositional projection temporal logic with star
Theoretical Computer Science
Compositional verification with stutter-invariant propositional projection temporal logic
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
A concurrent temporal programming model with atomic blocks
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
A complete proof system for propositional projection temporal logic
Theoretical Computer Science
| Hi-index | 0.00 |
This paper investigates a model checking algorithm for Propositional Projection Temporal Logic (PPTL) with finite models. To this end, a PPTL formula is transformed to a Normal Form Graph (NFG), and then a Nondeterministic Finite Automaton (NFA). The NFA precisely characterizes the finite models satisfying the corresponding formula and can be equivalently represented as a Deterministic Finite Automaton (DFA). When the system to be verified can be modeled as a DFA As, and the property of the system can be specified by a PPTL formula P, then ¬P can be transformed to a DFA Ap. Thus, whether the system satisfies the property or not can be checked by computing the product automaton of As and Ap, and then checking whether or not the product automaton accepts the empty word. Further, this method can be implemented by means of the verification system SPIN.