CTL\(^\ast\) with graded path modalities

DOI10.1016/j.ic.2018.05.001zbMath1407.03028OpenAlexW2799335769MaRDI QIDQ1784942

Sasha Rubin, Benjamin Aminof, Aniello Murano

Publication date: 27 September 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-3808

zbMATH Keywords

automatamodel checkingtemporal logicsatisfiabilityexpressiveness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (2)

Sublogics of a branching time logic of robustness ⋮ Model-checking graded computation-tree logic with finite path semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved model checking of hierarchical systems
• Decidability of SHIQ with complex role inclusion axioms
• Handbook of weighted automata
• Reasoning about infinite computations
• Counting on CTL\(^*\): On the expressive power of monadic path logic
• Monadic second-order logic on tree-like structures
• Graded modalities in strategy logic
• Reasoning about graded strategy quantifiers
• A note on graded modal logic
• Answering regular path queries in expressive description logics via alternating tree-automata
• In so many possible worlds
• PSPACE Reasoning for Graded Modal Logics
• Graded computation tree logic
• What’s Decidable about Weighted Automata?
• Querying Regular Graph Patterns
• Model Checking for Graded CTL
• Reasoning with Forest Logic Programs Using Fully Enriched Automata
• On CTL* with Graded Path Modalities
• Enriched MU-Calculi Module Checking
• The Complexity of Enriched Mu-Calculi
• CTL Model-Checking with Graded Quantifiers
• Deciding full branching time logic
• Church's Problem Revisited
• The Complexity of Tree Automata and Logics of Programs
• Additional Winning Strategies in Reachability Games*†
• Reasoning and Query Answering in Description Logics
• Global Numerical Constraints on Trees
• An automata-theoretic approach to branching-time model checking
• Computer Aided Verification

This page was built for publication: CTL\(^\ast\) with graded path modalities