Partial model checking of modal equations: A survey

Andersen, Henrik Reif; Lind-Nielsen, Jørn

doi:10.1007/s100090050032

Cited by 12 publications

(19 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By considering only binary associative composition operators, previous works [2,4,8] are not directly applicable to more general operators, such as m among n synchronisation and parallel composition by synchronisation interfaces [21], present in the E-Lotos standard and variants [13,25]. Our first contribution in this paper is thus a generalisation of partial model checking to networks of Ltss [28], a general model that subsumes parallel composition, hiding, cutting, and renaming operators of standard process languages (Ccs, Csp, μCrl, Lotos, E-Lotos, etc.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Lang

Mateescu

2012

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. 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 formula that can be verified on a smaller composition from which the incorporated process has been removed. Simplifications of the formula must be applied at each step, so as to maintain the formula at a tractable size. In this paper, we revisit partial model checking. First, we extend quotienting to the network of labelled transition systems model, which subsumes most parallel composition operators, including m among n synchronisation and parallel composition using synchronisation interfaces, available in the E-Lotos standard. Second, we reformulate quotienting in terms of a simple synchronous product between a graph representation of the formula (called formula graph) and a process, thus enabling quotienting to be implemented efficiently and easily, by reusing existing tools dedicated to graph compositions. Third, we propose simplifications of the formula as a combination of bisimulations and reductions using Boolean equation systems applied directly to the formula graph, thus enabling formula simplifications also to be implemented easily and efficiently. Finally, we describe an implementation in the Cadp (Construction and Analysis of Distributed Processes) toolbox and present some experimental results in which partial model checking uses hundreds of times less memory than on-the-fly model checking.

show abstract

Section: Introductionmentioning

confidence: 99%

“…In this paper, we explore a dual approach named partial model checking, proposed by Andersen [2,4] for concurrent processes running asynchronously and composed using Ccs parallel composition and restriction operators. For a modal μ-calculus [26] formula ϕ and a process composition P 1 || .…”

Section: Introductionmentioning

confidence: 99%

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

Lang

Mateescu

2012

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…Lang. FSA [19,31] μ-calculus [1,3] Theory FSA [19,31] LTS [1,3] Complexity EXPTIME [14,32] EXPTIME [1,3] Tools TCT [13], IDES3 [30], DESTool [28] mCRL2 [18], CADP [23], MuDiv [2] satisfies the specification after quotienting against the other [1]. This may reduce the problem size, resulting in smaller models and hence faster verification.…”

Section: Natural Projection Partial MCmentioning

confidence: 99%

From Natural Projection to Partial Model Checking and Back

Costa

Basin

Bodei

et al. 2018

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Specification decomposition is a theoretically interesting and practically relevant problem for which two approaches were independently developed by the control theory and verification communities: natural projection and partial model checking. In this paper we show that, under reasonable assumptions, natural projection reduces to partial model checking and, when cast in a common setting, the two are equivalent. Aside from their theoretical interest, our results build a bridge whereby the control theory community can reuse algorithms and results developed by the verification community. In addition, we present an algorithm and a tool for the partial model checking of finite-state automata that can be used as an alternative to natural projection.

show abstract

“…In this paper, we explore a dual approach named partial model checking, proposed by Andersen [2,3] for concurrent processes running asynchronously and composed using Ccs parallel composition and restriction operators. For a modal µ-calculus [29] formula ϕ and a process composition P 1 || .…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we focus on partial model checking of the modal µ-calculus applied to (untimed) concurrent asynchronous processes. By considering only binary associative parallel composition operators (such as Ccs and Csp parallel compositions), previous works [2,3,7] are not directly applicable to more general operators, such as m-among-n synchronisation (where among n processes executing in parallel, any m of them must synchronise on a given action) and parallel composition by synchronisation interfaces (where all processes containing a given action in their synchronisation interface must synchronise on that action) [24], present in the E-Lotos standard and variants [12,28]. Our first contribution in this paper is thus a generalisation of partial model checking to networks of Ltss [31], a general model that subsumes parallel composition, hiding, cutting, and renaming operators of standard process languages (Ccs, Csp, µCrl, Lotos, E-Lotos, etc.…”

Section: Introductionmentioning

confidence: 99%

Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems

Lang¹,

Mateescu²

2013

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. 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 formula that can be verified on a smaller composition from which the incorporated process has been removed. Simplifications of the formula must be applied at each step, so as to maintain the formula at a tractable size. In this paper, we revisit partial model checking. First, we extend quotienting to the network of labelled transition systems model, which subsumes most parallel composition operators, including m-among-n synchronisation and parallel composition using synchronisation interfaces, available in the E-Lotos standard. Second, we reformulate quotienting in terms of a simple synchronous product between a graph representation of the formula (called formula graph) and a process, thus enabling quotienting to be implemented efficiently and easily, by reusing existing tools dedicated to graph compositions. Third, we propose simplifications of the formula as a combination of bisimulations and reductions using Boolean equation systems applied directly to the formula graph, thus enabling formula simplifications also to be implemented efficiently. Finally, we describe an implementation in the Cadp (Construction and Analysis of Distributed Processes) toolbox and present some experimental results in which partial model checking uses hundreds of times less memory than on-the-fly model checking.

show abstract

Partial model checking of modal equations: A survey

Cited by 12 publications

References 24 publications

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

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

From Natural Projection to Partial Model Checking and Back

Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems

Contact Info

Product

Resources

About