scientific article; zbMATH DE number 1765663

zbMath0988.03053MaRDI QIDQ4539599

Moshe Y. Vardi, Ulrike Sattler

Publication date: 10 July 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2083/20830076

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (19)

On the Hybrid Extension of CTL and CTL + ⋮ A logic of reachable patterns in linked data-structures ⋮ Enriched μ–Calculus Pushdown Module Checking ⋮ Global view on reactivity: switch graphs and their logics ⋮ Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA ⋮ On model checking multiple hybrid views ⋮ On the expressive power of hybrid branching-time logics ⋮ Reasoning and Query Answering in Description Logics ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics ⋮ Unnamed Item ⋮ Terminating Tableaux for Hybrid Logic with Eventualities ⋮ Model checking for hybrid branching-time logics ⋮ ExpTime tableaux with global caching for hybrid PDL ⋮ Clausal Tableaux for Hybrid PDL ⋮ Hilbert-Style Axiomatization for Hybrid XPath with Data ⋮ Unnamed Item ⋮ Modal Expressiveness of Graph Properties ⋮ A goal-directed decision procedure for hybrid PDL ⋮ On the undecidability of logics with converse, nominals, recursion and counting

This page was built for publication: