Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems

DOI10.1007/978-3-642-28756-5_11zbMath1352.68158arXiv1309.6947OpenAlexW1848561722MaRDI QIDQ2894270

Radu Mateescu, Frédéric Lang

Publication date: 29 June 2012

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6947

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Compositional verification of concurrent systems by combining bisimulations ⋮ On first-order runtime enforcement of branching-time properties ⋮ Unnamed Item ⋮ Natural projection as partial model checking ⋮ Compositional verification of asynchronous concurrent systems using CADP

Uses Software

• CADP

This page was built for publication: Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems