Branching-Time Temporal Logics with Minimal Model Quantifiers

DOI10.1007/978-3-642-02737-6_32zbMath1247.03026OpenAlexW1600588018MaRDI QIDQ3637242

Fabio Mogavero, Aniello Murano

Publication date: 7 July 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_32

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (1)

Reasoning About Substructures and Games

Uses Software

• CESAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The temporal semantics of concurrent programs
• Decision procedures and expressiveness in the temporal logic of branching time
• Undecidability and nonperiodicity for tilings of the plane
• The complexity of verification
• Graded computation tree logic
• Alternating-time temporal logic
• The Complexity of Enriched μ-Calculi
• Expressive number restrictions in description logics
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• An automata-theoretic approach to branching-time model checking
• The undecidability of the domino problem

This page was built for publication: Branching-Time Temporal Logics with Minimal Model Quantifiers