Abstract
The use of driving assistance systems up to the level of autonomous cars asks for methods showing that cars equipped with such systems behave safely. In previous work, we realised that spatial reasoning is a key to prove collision freedom. Our method was based on a dedicated Multi-lane Spatial Logic (MLSL) for traffic on motorways [10].
In this paper, we extend this approach by taking into account the plans of cars in the near future up to a certain time bound. We employ runtime monitoring of car traffic on motorways using extended State Clock automata for State Clock Logic (SCL) as defined in [17]. The extensions are that the SC automata use MLSL formulae as propositional symbols as in Timed MLSL [2] and communication primitives as in Timed Automata of UPPAAL. The idea is that a car can perform a traffic manoeuvre like a lane change only if it successfully communicates with all surrounding cars that check their internal extended SC automata for compliance with their safety and time constraints in the near future.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994). https://doi.org/10.1016/0304-3975(94)90010-8
Bischopink, C., Olderog, E.R.: Spatial and timing properties in highway traffic. In: Seidl, H., Liu, Z., Pasareanu, C.S. (eds.) Theoretical Aspects of Computing, ICTAC 2022, Proceedings. LNCS, vol. 13572, pp. 114–131. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-17715-6
Dierks, H.: PLC-automata: a new class of implementable real-time automata. Theor. Comput. Sci. 253(1), 61–93 (2001). https://doi.org/10.1016/S0304-3975(00)00089-X
Falcone, Y.: You should better enforce than verify. In: Barringer, H., et al. (eds.) Runtime Verification, pp. 89–105. Springer, Cham (2010). https://doi.org/10.1007/978-3-642-16612-9
Fränzle, M., Hansen, M.R., Ody, H.: No need knowing numerous neighbours - towards a realizable interpretation of MLSL. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 152–171. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23506-6_11
Gleirscher, M., Peleska, J.: Complete test of synthesised safety supervisors for robots and autonomous systems. In: Farrell, M., Luckcuck, M. (eds.) Proceedings Third Workshop on Formal Methods for Autonomous Systems, FMAS 2021, Virtual. EPTCS, vol. 348, pp. 101–109 (2021). https://doi.org/10.4204/EPTCS.348.7
Haxthausen, A.E., Peleska, J.: Formal development and verification of a distributed railway control system. IEEE Trans. Software Eng. 26(8), 687–701 (2000). https://doi.org/10.1109/32.879808
Haxthausen, A.E., Peleska, J., Kinder, S.: A formal approach for the construction and verification of railway control systems. Formal Aspects Comput. 23(2), 191–219 (2011). https://doi.org/10.1007/s00165-009-0143-6
Hilscher, M., Linker, S., Olderog, E.R.: Proving safety of traffic manoeuvres on country roads. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 8051, pp. 196–212. Springer, Cham (2013). https://doi.org/10.1007/978-3-642-39698-4_12
Hilscher, M., Linker, S., Olderog, E.-R., Ravn, A.P.: An abstract model for proving safety of multi-lane traffic manoeuvres. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 404–419. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24559-6_28
Krieg-Brückner, B., Peleska, J., Olderog, E.R., Baer, A.: The UniForM workbench, a universal development environment for formal methods. In: Wing, J.M., Woodcock, J., Davies, J. (eds.) FM 1999 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Proceedings, Volume II. LNCS, vol. 1709, pp. 1186–1205. Springer, Cham (1999). https://doi.org/10.1007/3-540-48118-4
Larsen, K., Petterson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transf. 1(1+2), 134–152 (1997). https://doi.org/10.1007/s100090050010
Linker, S., Hilscher, M.: Proof theory of a multi-lane spatial logic. Log. Methods Comput. Sci. 11(3) (2015). https://doi.org/10.2168/LMCS-11(3:4)2015
Lopez, P.A., et al.: Microscopic traffic simulation using SUMO. In: The 21st IEEE International Conference on Intelligent Transportation Systems, pp. 2575–2582. IEEE, November 2018. https://elib.dlr.de/127994/
Olderog, E.R.: Space for traffic manoeuvres: an overview. In: Jones, C.B., Wang, J., Zhan, N. (eds.) Symposium on Real-Time and Hybrid Systems. LNCS, vol. 11180, pp. 211–230. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01461-2
Peleska, J.: New distribution paradigms for railway interlocking. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation: Applications, ISoLA 2020, Proceedings, Part III. LNCS, vol. 12478, pp. 434–448. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-61467-6
Raskin, J.-F., Schobbens, P.-Y.: State clock logic: a decidable real-time logic. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 33–47. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0014711
Schneider, F.B.: Enforceable security policies. ACM Trans. Inf. Syst. Secur. 3(1), 30–50 (2000). https://doi.org/10.1145/353323.353382
Schwammberger, M.: An abstract model for proving safety of autonomous urban traffic. Theor. Comput. Sci. 744, 143–169 (2018). https://doi.org/10.1016/j.tcs.2018.05.028
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bischopink, C., Olderog, ER. (2023). Time for Traffic Manoeuvres. In: Haxthausen, A.E., Huang, Wl., Roggenbach, M. (eds) Applicable Formal Methods for Safe Industrial Products. Lecture Notes in Computer Science, vol 14165. Springer, Cham. https://doi.org/10.1007/978-3-031-40132-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-40132-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-40131-2
Online ISBN: 978-3-031-40132-9
eBook Packages: Computer ScienceComputer Science (R0)