Monitoring of Traffic Manoeuvres with Imprecise Information

Heinrich Ody

In monitoring, we algorithmically check if a single behavior satisfies a property. Here, we consider monitoring for Multi-Lane Spatial Logic (MLSL). The behavior is given as a finite transition sequence of MLSL and the property is that a spatial MLSL formula should hold at every point in time within the sequence. In our procedure we transform the transition sequence and the formula to the first-order theory of real-closed fields, which is decidable, such that the resulting formula is valid iff the MLSL formula holds throughout the transition sequence. We then assume that temporal data may have an error of up to ε, and that spatial data may have an error of up to δ. We extend our procedure to check if the MLSL formula ε-δ-robustly holds throughout the transition sequence.

In Lukas Bulwahn, Maryam Kamali and Sven Linker: Proceedings First Workshop on Formal Verification of Autonomous Vehicles (FVAV 2017), Turin, Italy, 19th September 2017, Electronic Proceedings in Theoretical Computer Science 257, pp. 43–58.
Published: 7th September 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.257.6 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org