Specification and verification of concurrent programs by A∀automata
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Embedding finite automata within regular expressions
Theoretical Computer Science
25 Years of Model Checking
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
An implementation of a multi-agent plan synchronizer
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Model checking active networks with SPIN
Computer Communications
IWSAS'01 Proceedings of the 2nd international conference on Self-adaptive software: applications
Model checking PSL using HOL and SMV
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Pillars of computer science
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Specifying and generating test cases using observer automata
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
From PSL to LTL: a formal validation in HOL
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
WSCMon: runtime monitoring of web service orchestration based on refinement checking
Service Oriented Computing and Applications
| Hi-index | 0.00 |
We start by proving that some properties of sequences are not expressible in Temporal Logic though they are expressible using for instance regular expressions. Then, we show how Temporal Logic can be extended to express any such property definable by a right-linear grammar and hence a regular expression, Finally, we give a decision procedure and complete axiomatization for the extended Temporal Logic.