Theoretical Computer Science
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Communicating sequential processes
Communications of the ACM
Discrete Supervisory Control of Hybrid Systems Based on l-Complete Approximations
Discrete Event Dynamic Systems
Formal Development and Verification of a Distributed Railway Control System
IEEE Transactions on Software Engineering
Axiomatisation and decidability of multi-dimensional Duration Calculus
Information and Computation
Automatic verification of parametric specifications with complex topologies
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
A calculus for shapes in time and space
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Proving safety of traffic manoeuvres on country roads
Theories of Programming and Formal Methods
Hi-index | 0.00 |
We present an approach to prove safety (collision freedom) of multi-lane motorway traffic with lane-change manoeuvres. This is ultimately a hybrid verification problem due to the continuous dynamics of the cars. We abstract from the dynamics by introducing a new spatial interval logic based on the view of each car. To guarantee safety, we present two variants of a lane-change controller, one with perfect knowledge of the safety envelopes of neighbouring cars and one which takes only the size of the neighbouring cars into account. Based on these controllers we provide a local safety proof for unboundedly many cars by showing that at any moment the reserved space of each car is disjoint from the reserved space of any other car.