Model checking hybrid logics (with an application to semistructured data)
From MaRDI portal
Temporal logic (03B44) Modal logic (including the logic of norms) (03B45) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
Cites work
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- A Modal Perspective on Path Constraints
- An approach to tense logic1
- An essay in combinatory dynamic logic
- Containment and equivalence for a fragment of XPath
- Hierarchies of modal and temporal logics with reference pointers
- scientific article; zbMATH DE number 1215461 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 1798186 (Why is no real title available?)
- scientific article; zbMATH DE number 2090297 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 1424043 (Why is no real title available?)
- scientific article; zbMATH DE number 3271460 (Why is no real title available?)
- Hybrid languages
- Hybrid logics: Characterization, interpolation and complexity
- Integrity constraints for XML
- Interpolation for extended modal languages
- Modal logic
- Model checking.
- Model-checking based data retrieval. An application to semistructured and temporal data.
- On the unusual effectiveness of logic in computer science
- Regular path queries with constraints
- Representing and reasoning on XML documents: a description logic approach
- The computational complexity of hybrid temporal logics
Cited in
(27)- Polyadic dynamic logics for HPSG parsing
- Complexity and succinctness issues for linear-time hybrid logics
- Model checking for hybrid logic
- The complexity of hybrid logics over equivalence relations
- Branching-time logics repeatedly referring to states
- Applying model-checking to solve queries on semistructured data
- Model-checking based data retrieval. An application to semistructured and temporal data.
- Model checking for hybrid branching-time logics
- The expressibility of fragments of hybrid graph logic on finite digraphs
- On finite-state approximants for probabilistic computation tree logic
- Linking semantic models to support \(\mathrm{CSP} \parallel \mathrm{B}\) consistency checking
- Hybrid and first-order complete extensions of CaRet
- Hybrid specification of reactive systems: an institutional approach
- Complexity and Succinctness Issues for Linear-Time Hybrid Logics
- A BISIMULATION CHARACTERIZATION THEOREM FOR HYBRID LOGIC WITH THE CURRENT-STATE BINDER
- Model Checking Strategic Equilibria
- A first step towards modeling semistructured data in hybrid multimodal logic
- scientific article; zbMATH DE number 2163033 (Why is no real title available?)
- A Logical Approach to Hamiltonian Graphs
- Complexity of Decision Problems for Mixed and Modal Specifications
- Logic of visibility in social networks
- Complexity of hybrid logics over transitive frames
- A study on multi-dimensional products of graphs and hybrid logics
- Visibility and exploitation in social networks
- A modular bisimulation characterisation for fragments of hybrid logic
- On model checking multiple hybrid views
- Model checking memoryful linear-time logics over one-counter automata
This page was built for publication: Model checking hybrid logics (with an application to semistructured data)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2506828)