JOURNAL ARTICLE
On the expressive power of hybrid branching-time logics
Year: 2020 Journal: Theoretical Computer Science Vol: 813 Pages: 362-374 Publisher: Elsevier BV
Keywords:
Decidability Computation tree logic Undecidable problem Branching (polymer chemistry) Satisfiability Model checking Mathematics CTL* Tree automaton Expressive power Bisimulation Computer science Discrete mathematics Automaton Algorithm Theoretical computer science
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
21
Refs
0.01
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Formal Methods in Verification
Physical Sciences → Computer Science → Computational Theory and Mathematics
Logic, programming, and type systems
Physical Sciences → Computer Science → Artificial Intelligence
Model-Driven Software Engineering Techniques
Physical Sciences → Computer Science → Software
Related Documents
JOURNAL ARTICLE
On the Expressive Power of the Normal Form for Branching-Time Temporal Logics
Journal: Electronic Proceedings in Theoretical Computer Science Year: 2022 Vol: 358 Pages: 254-269
JOURNAL ARTICLE
Model checking for hybrid branching-time logics
Journal: Journal of Logical and Algebraic Methods in Programming Year: 2018 Vol: 110 Pages: 100427-100427
BOOK-CHAPTER
Decidability and Expressive Power of Real Time Logics
Lecture notes in computer science Year: 2006 Pages: 32-32
BOOK-CHAPTER
Branching-Time Temporal Logics
Stéphane DemriValentin GorankoMartin Lange
Cambridge University Press eBooks Year: 2016 Pages: 209-270