scientific article
From MaRDI portal
Publication:2760241
zbMath1002.03021MaRDI QIDQ2760241
Julian Bradfield, Colin Stirling
Publication date: 7 January 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (48)
Coinductive predicates and final sequences in a fibration ⋮ Abstraction in Fixpoint Logic ⋮ An intensional fixed point theory over first order arithmetic ⋮ Compositional analysis for verification of parameterized systems ⋮ Branching time and orthogonal bisimulation equivalence ⋮ A focus system for the alternation-free \(\mu \)-calculus ⋮ Model-Checking Games for Fixpoint Logics with Partial Order Models ⋮ A clausal resolution method for branching-time logic \(\text{ECTL}^+\) ⋮ Unnamed Item ⋮ On the relation between reactive synthesis and supervisory control of non-terminating processes ⋮ Deciding the unguarded modal -calculus ⋮ Characteristic invariants in Hennessy-Milner logic ⋮ Solving Linear Equations in *-continuous Action Lattices ⋮ On temporal logic versus Datalog ⋮ Temporal-logic property preservation under Z refinement ⋮ Model Checking Contracts – A Case Study ⋮ Unnamed Item ⋮ Mathematical modal logic: A view of its evolution ⋮ Local Model Checking in a Logic for True Concurrency ⋮ A graphical \(\mu\)-calculus and local model checking. ⋮ Canonical completeness of infinitary \(\mu \) ⋮ The Modal μ-Calculus Caught Off Guard ⋮ Enhancing unsatisfiable cores for LTL with information on temporal relevance ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Model Checking Games ⋮ A Multi-Core Solver for Parity Games ⋮ A saturation method for the modal \(\mu \)-calculus over pushdown systems ⋮ On first-order logic and CPDA graphs ⋮ On modal \(\mu\)-calculus and non-well-founded set theory ⋮ A clausal resolution method for extended computation tree logic ECTL ⋮ A parametric analysis of the state-explosion problem in model checking ⋮ Syntactic cut-elimination for a fragment of the modal mu-calculus ⋮ Verification of reactive systems via instantiation of parameterised Boolean equation systems ⋮ On Global Model Checking Trees Generated by Higher-Order Recursion Schemes ⋮ Predicate liftings and functor presentations in coalgebraic expression languages ⋮ On the proof theory of the modal mu-calculus ⋮ On modal \(\mu \)-calculus and Gödel-Löb logic ⋮ Formal Properties of Modularisation ⋮ The many faces of interpolation ⋮ Unnamed Item ⋮ Coinductive predicates and final sequences in a fibration ⋮ A Logical Process Calculus ⋮ Modal Logics for Cryptographic Processes ⋮ Mu-calculus path checking ⋮ Parameterised Boolean equation systems ⋮ NP reasoning in the monotone \(\mu\)-calculus ⋮ On qualitative route descriptions. Representation, agent models, and computational complexity ⋮ Compositional verification of asynchronous concurrent systems using CADP
This page was built for publication:
