Property-dependent reductions adequate with divergence-sensitive branching bisimilarity

Mateescu, Radu; Wijs, Anton

doi:10.1016/j.scico.2014.04.004

Cited by 13 publications

(29 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we focus on property-dependent compositional state space construction, where the reduction to be applied to the system is obtained by analysing the property under verification. We will refine the approach of [37] which, given a formula ϕ of L μ to be verified, shows how to extract from ϕ a maximal hiding set of actions and a reduction (minimization for either strong [40] or divergence-preserving 3 branching -divbranching for short -bisimilarity [20,23]) that preserves the truth value of ϕ. The reduction is chosen according to whether ϕ belongs to an L μ fragment named L dbr μ , which is adequate with divbranching bisimilarity.…”

Section: Institute Of Engineering Univ Grenoble Alpesmentioning

confidence: 99%

Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities

Lang

Mateescu

Mazzanti

2020

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

We showed in a recent paper that, when verifying a modal $$\mu $$-calculus formula, the actions of the system under verification can be partitioned into sets of so-called weak and strong actions, depending on the combination of weak and strong modalities occurring in the formula. In a compositional verification setting, where the system consists of processes executing in parallel, this partition allows us to decide whether each individual process can be minimized for either divergence-preserving branching (if the process contains only weak actions) or strong (otherwise) bisimilarity, while preserving the truth value of the formula. In this paper, we refine this idea by devising a family of bisimilarity relations, named sharp bisimilarities, parameterized by the set of strong actions. We show that these relations have all the nice properties necessary to be used for compositional verification, in particular congruence and adequacy with the logic. We also illustrate their practical utility on several examples and case-studies, and report about our success in the RERS 2019 model checking challenge.

show abstract

Section: Institute Of Engineering Univ Grenoble Alpesmentioning

confidence: 99%

Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities

Lang

Mateescu

Mazzanti

2020

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Correctness of transformations is interpreted as the preservation of properties. Given a property ϕ written in a fragment of the μ-calculus [MW14], and a system of transformation rules , Refiner checks whether preserves ϕ for all possible inputs. This is done by first hiding all behaviour irrelevant for ϕ [MW14] and then checking whether the rules replace parts of the input LTSs by new parts that are branching bisimilar to the old ones.…”

Section: Fig 1 Lts Transformation Verification With Refinermentioning

confidence: 99%

“…Given a property ϕ written in a fragment of the μ-calculus [MW14], and a system of transformation rules , Refiner checks whether preserves ϕ for all possible inputs. This is done by first hiding all behaviour irrelevant for ϕ [MW14] and then checking whether the rules replace parts of the input LTSs by new parts that are branching bisimilar to the old ones. Branching bisimilarity preserves safety properties and a subset of liveness properties involving inevitable reachability [vGW96].…”

Section: Fig 1 Lts Transformation Verification With Refinermentioning

confidence: 99%

“…Next, property-based hiding [MW14] is performed, given a property ϕ to check. Finally, the resulting abstract state spaces are compared using a branching bisimulation checking algorithm.…”

Section: Fig 1 Lts Transformation Verification With Refinermentioning

confidence: 99%

“…The technique is comparable to our technique with two main exceptions. First, they consider weak bisimilarity for the comparison of rule patterns, which preserves a strictly smaller fragment of the μ-calculus than branching bisimilarity [MW14]. Second, their technique does not allow transforming the communication interfaces between components.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A formal verification technique for behavioural model-to-model transformations

Putter

Wijs

2018

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract. In Model Driven Software Engineering, models and model transformations are the primary artifacts when developing a software system. In such a workflow, model transformations are used to incrementally transform initial abstract models into concrete models containing all relevant system details. Over the years, various formal methods have been proposed and further developed to determine the functional correctness of models of concurrent systems. However, the formal verification of model transformations has so far not received as much attention. In this article, we propose a formal verification technique to determine that formalisations of such transformations in the form of rule systems are guaranteed to preserve functional properties, regardless of the models they are applied on. This work extends our earlier work in various ways. Compared to our earlier approaches, the current technique involves only up to n individual checks, with n the number of rules in the rule system, whereas previously, up to 2 n − 1 checks were required. Furthermore, a full correctness proof for the technique is presented, based on a formal proof conducted with the Coq proof assistant. Finally, we report on two sets of conducted experiments. In the first set, we compared traditional model checking with transformation verification, and in the second set, we compared the verification technique presented in this article with the previous version.

show abstract

Compositional Verification of Concurrent Systems by Combining Bisimulations

Lang

Mateescu

Mazzanti

2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

One approach to verify a property expressed as a modal µcalculus formula on a system with several concurrent processes is to build the underlying state space compositionally (i.e., by minimizing and recomposing the state spaces of individual processes, keeping visible only the relevant actions occurring in the formula), and check the formula on the resulting state space. It was shown previously that, when checking the formulas of the L dsbr µ fragment of µ-calculus (consisting of weak modalities only), individual processes can be minimized modulo divergencepreserving branching (divbranching) bisimilation. In this paper, we refine this approach to handle formulas containing both strong and weak modalities, so as to enable a combined use of strong or divbranching bisimulation minimization on concurrent processes depending whether they contain or not the actions occurring in the strong modalities of the formula. We extend L dsbr µ with strong modalities and show that the combined minimization approach preserves the truth value of formulas of the extended fragment. We implemented this approach on top of the CADP verification toolbox and demonstrated how it improves the capabilities of compositional verification on realistic examples of concurrent systems.

show abstract

Property-dependent reductions adequate with divergence-sensitive branching bisimilarity

Cited by 13 publications

References 38 publications

Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities

Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities

A formal verification technique for behavioural model-to-model transformations

Compositional Verification of Concurrent Systems by Combining Bisimulations

Contact Info

Product

Resources

About