Model checking for hybrid logic
From MaRDI portal
Publication:1047796
Recommendations
Cites work
- A first step towards modeling semistructured data in hybrid multimodal logic
- A lattice-theoretical fixpoint theorem and its applications
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- An approach to tense logic1
- An essay in combinatory dynamic logic
- Hierarchies of modal and temporal logics with reference pointers
- scientific article; zbMATH DE number 1670778 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 1142324 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 757637 (Why is no real title available?)
- Hybridizing concept languages
- Interpolation for extended modal languages
- Local model checking in the modal mu-calculus
- Model checking and boolean graphs
- Model checking hybrid logics (with an application to semistructured data)
- Symbolic model checking: \(10^{20}\) states and beyond
- Tableau-based model checking in the propositional mu-calculus
- The computational complexity of hybrid temporal logics
- Using branching time temporal logic to synthesize synchronization skeletons
Cited in
(7)- Model checking for hybrid branching-time logics
- The expressibility of fragments of hybrid graph logic on finite digraphs
- Model checking hybrid logics (with an application to semistructured data)
- Hybrid specification of reactive systems: an institutional approach
- Combining Model Checking and Deduction
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Model Checking for Coalition Announcement Logic
This page was built for publication: Model checking for hybrid logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1047796)