The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Current trends in concurrency. Overviews and tutorials
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Specification and verification of concurrent programs by A∀automata
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
A really abstract concurrent model and its temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program logic without binding is decidable
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Results on the Propositional µ-Calculus
Proceedings of the 9th Colloquium on Automata, Languages and Programming
The Propositional Mu-Calculus is Elementary
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework
Seminar on Concurrency, Carnegie-Mellon University
Proceedings of the Conference on Logic of Programs
Real-time programming and asynchronous message passing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The Collapsing Hierarchies
Temporal logic programming is complete and expressive
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the representation of infinite temporal data and queries (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Temporal and modal logic programming: an annotated bibliography
ACM SIGART Bulletin
Verifying infinite state processes with sequential and parallel composition
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient checking of temporal integrity constraints using bounded history encoding
ACM Transactions on Database Systems (TODS)
Symbolic User-Defined Periodicity in Temporal Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
A Modal Mu-Calculus for Durational Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Reasoning on regular path queries
ACM SIGMOD Record
Temporal Development Methods for Agent-Based
Autonomous Agents and Multi-Agent Systems
Information and Computation
A mathematical framework for the semantics of symbolic languages representing periodic time
Annals of Mathematics and Artificial Intelligence
Information Processing Letters
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
Complexity results on branching-time pushdown model checking
Theoretical Computer Science
A modular approach to user-defined symbolic periodicities
Data & Knowledge Engineering
25 Years of Model Checking
Complexity and Succinctness Issues for Linear-Time Hybrid Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Impartial Anticipation in Runtime-Verification
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Complexity and succinctness issues for linear-time hybrid logics
Theoretical Computer Science
Memoryless Strategies for Stochastic Games via Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Bounded Model Checking for All Regular Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Information Processing Letters
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Symbolic backwards-reachability analysis for higher-order pushdown systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On the expressive power of QLTL
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
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
The complexity of CTL* + linear past
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Pillars of computer science
Formal parameters of phonology: from government phonology to SPE
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Relentful strategic reasoning in alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Expressiveness of propositional projection temporal logic with star
Theoretical Computer Science
Alternation elimination for automata over nested words
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Size-change termination and satisfiability for linear-time temporal logics
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A proof system for the linear time μ-calculus
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
View-based query processing: on the relationship between rewriting, answering and losslessness
ICDT'05 Proceedings of the 10th international conference on Database Theory
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Complexity results on branching-time pushdown model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Verifying quantitative properties using bound functions
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Journal of Computer and System Sciences
Ramsey-Based analysis of parity automata
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Fixpoints in temporal description logics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Linear time logics around PSL: complexity, expressiveness, and a little bit of succinctness
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Linear-Time model-checking for multithreaded programs under scope-bounding
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Foundations of data-aware process analysis: a database theory perspective
Proceedings of the 32nd symposium on Principles of database systems
On the complexity of verifying regular properties on flat counter systems,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
Two distinct extensions of temporal logic has been recently advocated in the literature. The first extension is the addition of fixpoint operators that enable the logic to make assertions about arbitrary regular events. The second extension is the addition of past temporal connectives that enables the logic to refer directly to the history of the computation. Both extensions are motivated by the desire to adapt temporal logic to modular, i.e., compositional, verification (as opposed to global verification). We introduce and study here the logic &mgr;TL, which is the extension of temporal logic by fixpoint operators and past temporal connectives. We extend the automata-theoretic paradigm to &mgr;TL. That is, we show how, given an &mgr;TL formula @@@@, we can produce a finite-state Büchi automaton A@@@@, whose size is at most exponentially bigger than the size of @@@@, such that A@@@@ accepts precisely the computations that satisfy @@@@. The result has immediate applications, e.g., an optimal decision procedure and a model-checking algorithm for &mgr;TL.