scientific article
From MaRDI portal
Publication:4036555
zbMath0769.68089MaRDI QIDQ4036555
No author found.
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
livenessprogram semanticsbranching time logicbranching time semanticssilent actionsinfinite computation trees modulo bisimulationsafety preordersimulation testingtree- automata
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (20)
Property preserving abstractions for the verification of concurrent systems ⋮ Towards the hierarchical verification of reactive systems ⋮ Reducing behavioural to structural properties of programs with procedures ⋮ Coupled similarity: the first 32 years ⋮ Translating FSP into LOTOS and networks of automata ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Cartesian difference categories ⋮ On hierarchically developing reactive systems ⋮ Inference of \(\omega\)-languages from prefixes. ⋮ Selective mu-calculus and formula-based equivalence of transition systems ⋮ Compositional verification of sequential programs with procedures ⋮ Minimal refinements of specifications in modal and temporal logics ⋮ Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous ⋮ Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities ⋮ Requirements, specifications, and minimal refinement ⋮ Minimal refinements of specifications in modal and temporal logics ⋮ Refined Interfaces for Compositional Verification ⋮ Using partial orders for the efficient verification of deadlock freedom and safety properties ⋮ Compositional verification of asynchronous concurrent systems using CADP ⋮ Reduced models for efficient CCS verification
This page was built for publication:
