Towards Validating a Platoon of Cristal Vehicles Using CSP||B

Authors:
Samuel Colin;Arnaud Lanoix;Olga Kouchnarenko;Jeanine Souquières
Affiliations:
LORIA --- DEDALE Team --- Campus scientifique, Vandoeuvre-Lés-Nancy, F-54506;LORIA --- DEDALE Team --- Campus scientifique, Vandoeuvre-Lés-Nancy, F-54506;LIFC --- TFC Team, Besançon, F-25030;LORIA --- DEDALE Team --- Campus scientifique, Vandoeuvre-Lés-Nancy, F-54506
Venue:
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Year:
2008

Citing 3
Cited 2

Communicating sequential processes

Communicating sequential processes
Communicating B Machines

ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Using a Process Algebra to Control B Operations

IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods

Changing system interfaces consistently: A new refinement strategy for CSP||B

Science of Computer Programming
Relaxing b sharing restrictions within CSP||B

SC'12 Proceedings of the 11th international conference on Software Composition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The so-called platooning problem consists in making autonomous vehicles move in a convoy. It crosses several domains: distributed systems, embedded systems, multi-agent systems and critical systems. We thus propose to use the combination named CSP||B of two well-known formal methods to assess and verify properties of this complex system. To that end we make use of previous theoretical results on CSP||B. We also illustrate how this methodology spans the multiple composition levels of the resulting model.