An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
From MaRDI portal
Publication:1854353
DOI10.1006/inco.1999.2846zbMath1005.03021OpenAlexW2050398281MaRDI QIDQ1854353
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1999.2846
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items
Limiting Until in Ordered Tree Query Languages ⋮ Path Checking for MTL and TPTL over Data Words ⋮ Expressive power and succinctness of the positive calculus of binary relations ⋮ A note on the characterization of TL [EF] ⋮ Invariance under stuttering in a temporal logic of actions ⋮ On the expressive power of hybrid branching-time logics ⋮ Adequate Sets of Temporal Connectives in CTL ⋮ The stuttering principle revisited ⋮ A note on the expressibility problem for modal logics and star-free regular expressions ⋮ Metric Temporal Logic with Counting ⋮ Unnamed Item ⋮ On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing ⋮ An infinite hierarchy of temporal logics over branching time ⋮ Taming past LTL and flat counter systems ⋮ On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Definability with bounded number of bound variables
- Classifying regular events in symbolic logic
- Reasoning in a restricted temporal logic
- On the expressive power of temporal logic
- An application of games to the completeness problem for formalized theories
- The complexity of propositional linear temporal logics
- On the Ehrenfeucht-Fraïssé game in theoretical computer science
- On finite monoids having only trivial subgroups
