On the expressive power of hybrid branching-time logics
type: Item
instance of: scholarly article
title: On the expressive power of hybrid branching-time logics
zbMATH Open document ID: 1433.03051
author: Daniel Kernberger
author: Martin Lange
published in: Theoretical Computer Science
publication date: 2020-04-21T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9781/
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 7191323
zbMATH Keywords: branching-time logics
zbMATH Keywords: hybrid logics
zbMATH Keywords: expressive power
MaRDI profile type: Publication
OpenAlex ID: W3002559822
cites work: Hybrid logics: Characterization, interpolation and complexity
cites work: Q4945233
cites work: The computational complexity of hybrid temporal logics
cites work: Representation, reasoning, and relational structures: a hybrid logic manifesto
cites work: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
cites work: Temporal logics in computer science. Finite-state systems
cites work: Q4850061
cites work: An application of games to the completeness problem for formalized theories
cites work: Using branching time temporal logic to synthesize synchronization skeletons
cites work: Decision procedures and expressiveness in the temporal logic of branching time
cites work: “Sometimes” and “not never” revisited
cites work: The Complexity of Tree Automata and Logics of Programs
cites work: An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
cites work: On the Hybrid Extension of CTL and CTL +
cites work: Q4539599
cites work: The fully hybrid \(\mu\)-calculus
DOI: 10.1016/J.TCS.2020.01.014
Recommended article: Q5079784
Recommended article: On the Complexity of Branching-Time Logics
Recommended article: Q4508400
Recommended article: On the expressivity and complexity of quantitative branching-time temporal logics
Recommended article: Model checking for hybrid branching-time logics
Recommended article: Q4733398
Recommended article: The computational complexity of hybrid temporal logics
Recommended article: Algorithmic properties of branching-time logics
Recommended article: Decision procedures and expressiveness in the temporal logic of branching time
Recommended article: Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables
description: scientific article; zbMATH DE number 7191323