scientific article
From MaRDI portal
Publication:2763694
zbMath0987.68849MaRDI QIDQ2763694
Michael Huth, David A. Schmidt, Radha Jagadeesan
Publication date: 22 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Computing methodologies and applications (68U99) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (33)
Abstraction and Abstraction Refinement ⋮ Bonsai: Cutting Models Down to Size ⋮ When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus ⋮ On Abstraction of Probabilistic Systems ⋮ An abstract interpretation toolkit for \(\mu\)CRL ⋮ On the consistency, expressiveness, and precision of partial modeling formalisms ⋮ Revising system specifications in temporal logic ⋮ Compositional Specification in Rewriting Logic ⋮ Multi-valued model checking games ⋮ Improved model checking of hierarchical systems ⋮ Temporal-logic property preservation under Z refinement ⋮ On tolerance of discrete systems with respect to transition perturbations ⋮ A formal model for service-oriented interactions ⋮ Three-valued abstraction for probabilistic systems ⋮ Modal transition systems with weight intervals ⋮ Combining search space partition and abstraction for LTL model checking ⋮ On model checking multiple hybrid views ⋮ 3-valued abstraction: More precision at less cost ⋮ Model-Checking View-Based Partial Specifications ⋮ EXPTIME-completeness of thorough refinement on modal transition systems ⋮ A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting ⋮ Parametric and Quantitative Extensions of Modal Transition Systems ⋮ Incompleteness of states w.r.t. traces in model checking ⋮ Static analysis of topology-dependent broadcast networks ⋮ Compositional verification and 3-valued abstractions join forces ⋮ Model checking of linear-time properties in multi-valued systems ⋮ Automatic Synthesis of Assumptions for Compositional Model Checking ⋮ Static Analysis Techniques for Parameterised Boolean Equation Systems ⋮ On the Complexity of Semantic Self-minimization ⋮ Refinement of Kripke Models for Dynamics ⋮ A semantic framework for the abstract model checking of tccp programs ⋮ On finite-state approximants for probabilistic computation tree logic ⋮ Refinement checking on parametric modal transition systems
Uses Software
This page was built for publication:
