Compositional Verification in Action

Equivalence checking is a formal verification approach that consists in proving that two programs or models are related modulo some equivalence relation, or that one is included in the other modulo some preorder relation. In the case of concurrent systems, which are often represented using labelled transition systems, the relations used for equivalence checking are bisimulations and their simulation preorders. In the case of probabilistic or stochastic systems, which are usually represented using Markov chains, the relations used for equivalence checking are lumpability, probabilistic and stochastic equivalences, and their associated preorders. The present article provides a synthetic overview of 40 years of research in the design of algorithms and software tools for equivalence checking.

show abstract

“…A comprehensive survey on compositional verification, from the 1990s to the present, can be found in [179].…”

Section: Algorithms For Compositional Verificationmentioning

confidence: 99%

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Garavel

Lang

2022

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…(1) a natural basis for compositional verification, so improving the viability and efficiency of formal approaches [71]; and (2) a basis for the heterogeneous verification techniques required across autonomous systems [72].…”

Section: Architecturesmentioning

confidence: 99%

An Overview of Verification and Validation Challenges for Inspection Robots

et al. 2021

View full text Add to dashboard Cite

The advent of sophisticated robotics and AI technology makes sending humans into hazardous and distant environments to carry out inspections increasingly avoidable. Being able to send a robot, rather than a human, into a nuclear facility or deep space is very appealing. However, building these robotic systems is just the start and we still need to carry out a range of verification and validation tasks to ensure that the systems to be deployed are as safe and reliable as possible. Based on our experience across three research and innovation hubs within the UK’s “Robots for a Safer World” programme, we present an overview of the relevant techniques and challenges in this area. As the hubs are active across nuclear, offshore, and space environments, this gives a breadth of issues common to many inspection robots.

show abstract

“…Decompositional minimisation is also related to compositional minimisation, in which the objective is to replace the state space of each component in a (given) parallel composition by an equivalent, smaller state space, while preserving the behaviour of the original specification [21,20]. A problem that is common to compositional minimisation and decompositional minimisation is that the size of the state spaces belonging to individual components summed together might exceed the size of the original state space [7]. One way to (partly) avoid this is by specifying interface constraints (also known as environmental constraints or context constraints), see [9,5].…”

Section: Related Workmentioning

confidence: 99%

Decomposing Monolithic Processes in a Process Algebra with Multi-actions

Laveaux

Willemse

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

A monolithic process is a single recursive equation with data parameters, which only uses nondeterminism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each process defines behaviour for a subset of the parameters of the monolithic process. For this decomposition we can show that a composition of these processes is strongly bisimilar to the monolithic process under a suitable synchronisation context. Minimising the resulting processes before determining their composition can be used to derive a state space that is smaller than the one obtained by a monolithic exploration. We apply the decomposition technique to several specifications to show that this works in practice. Finally, we prove that state invariants can be used to further improve the effectiveness of this decomposition technique.

show abstract

Compositional Verification in Action

Cited by 16 publications

References 63 publications

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

An Overview of Verification and Validation Challenges for Inspection Robots

Decomposing Monolithic Processes in a Process Algebra with Multi-actions

Contact Info

Product

Resources

About