Classifying discrete temporal properties

Authors:
Thomas Wilke
Affiliations:
Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 11
Cited 23

Temporal logic of programs

Temporal logic of programs
Over words, two variables are as powerful as one quantifier alternation

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stutter-invariant temporal properties are expressible without the next-time operator

Information Processing Letters
Specifying Concurrent Program Modules

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Until Hierarchy for Temporal Logic

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
First-Order Logic with Two Variables and Unary Temporal

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy

Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
Temporal logic and semidirect products: an effective characterization of the until hierarchy

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Tight bounds on the complexity of cascaded decomposition of automata

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

LTL is expressively complete for Mazurkiewicz traces

Journal of Computer and System Sciences
On Bounded Specifications

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
LTL Is Expressively Complete for Mazurkiewicz Traces

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Temporal logic with cyclic counting and the degree of aperiodicity of finite automata

Acta Cybernetica
Vectorial languages and linear temporal logic

Theoretical Computer Science
Characterizing EF and EX tree logics

Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Pure future local temporal logics are expressively complete for Mazurkiewicz traces

Information and Computation
A note on the characterization of TL[EF]

Information Processing Letters
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics

Fundamenta Informaticae
Effective characterizations of tree logics

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree Languages Defined in First-Order Logic with One Quantifier Alternation

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Local temporal logic is expressively complete for cograph dependence alphabets

Information and Computation
Automata vs. logics on data words

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Characteristic patterns for LTL

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
An NP-Complete fragment of LTL

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics

Fundamenta Informaticae
On the succinctness of RoCTL

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
On the succinctness of RoCTL

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Linear temporal logic and linear dynamic logic on finite traces

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys recent results on the classiffication of discrete temporal properties, gives an introduction to the methods that have been developed to obtain them, and explains the connections to the theory of finite automata, the theory of finite semigroups, and to first-order logic.