Branching-time logics repeatedly referring to states

DOI10.1007/S10849-009-9093-XMaRDI QIDQ1047801zbMATH OpenOpenAlexFDO

Authors V. Weber

Publication date 6 January 2010

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10849-009-9093-x

zbMATH Keywords

alternating tree automatabranching time logiccomplexityCTLhybrid logicpebble automatasatisfiabilitysymmetric automatatemporal logic

Mathematics Subject Classification ID

Temporal logic (03B44) Combined logics (03B62) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1418373
• The temporal logic of branching time
• Branching-time logics with path relativisation
• An infinite hierarchy of temporal logics over branching time
• Decision procedures and expressiveness in the temporal logic of branching time
• Branching-time temporal logic and tree automata
• Transition semantics for branching time
• A branching time logic with past operators
• A note about the axioms for branching-time logic
• A Decidable Temporal Logic of Repeating Values

Cites work

• “Sometimes” and “not never” revisited
• 25 years of model checking. History, achievements, perspectives
• A hierarchy of temporal logics with past
• Bounded-Variable Fragments of Hybrid Logics
• Complexity of hybrid logics over transitive frames
• Computer Science Logic
• Domino-tiling games
• scientific article; zbMATH DE number 4027441 (Why is no real title available?)
• scientific article; zbMATH DE number 1223729 (Why is no real title available?)
• scientific article; zbMATH DE number 1500644 (Why is no real title available?)
• scientific article; zbMATH DE number 1536552 (Why is no real title available?)
• scientific article; zbMATH DE number 1424043 (Why is no real title available?)
• scientific article; zbMATH DE number 3339435 (Why is no real title available?)
• Hybrid logics: Characterization, interpolation and complexity
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• LTL with the freeze quantifier and register automata
• Model checking hybrid logics (with an application to semistructured data)
• Specification in CTL + past for verification in CTL.
• The Complexity of CTL* + Linear Past
• The temporal logic of branching time

Cited in

(5)

• Model checking for hybrid branching-time logics
• Expressiveness of hybrid temporal logic on data words
• On the Complexity of Branching-Time Logics
• On the expressive power of hybrid branching-time logics
• The complexity of satisfiability for fragments of hybrid logic. I.

This page was built for publication: Branching-time logics repeatedly referring to states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1047801)