Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems
Partial model checking was proposed by Andersen in 1995 to verify a temporal logic formula compositionally on a composition of processes. It consists in incrementally incorporating into the formula the behavioural information taken from one process - an operation called quotienting - to obtain a new...
Main Authors: | Frédéric Lang, Radu Mateescu |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2013-10-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/763/pdf |
Similar Items
-
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
by: Diego Latella, et al.
Published: (2015-12-01) -
Model Checking Synchronized Products of Infinite Transition Systems
by: Stefan Wöhrle, et al.
Published: (2007-11-01) -
Using models to model-check recursive schemes
by: Sylvain Salvati, et al.
Published: (2015-06-01) -
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
by: Thomas Neele, et al.
Published: (2021-07-01) -
Correct and Efficient Antichain Algorithms for Refinement Checking
by: Maurice Laveaux, et al.
Published: (2021-02-01)