A Formal Semantics for Traffic Sequence Charts

  • Werner Damm
  • Eike Möhlmann
  • Thomas Peikenkamp
  • Astrid RakowEmail author
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10760)


This paper paves the way for a future scenario catalog-based approach to acceptance testing for highly autonomous vehicles by providing a rigorous formal semantics for a visual specification language of traffic sequence charts to be used for building the scenario catalog. It builds on our previous work on Live Sequence Charts [2] that defines a semantics sufficiently rich to cover both the requirement analysis phase and the specification phase for highly autonomous vehicles. This formal semantics provides the basis for tool support, in particular supporting the future V&V environment for autonomously driving cars under development by the German automotive industry.


  1. 1.
    Damm, W., Finkbeiner, B.: Does it pay to extend the perimeter of a world model? In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 12–26. Springer, Heidelberg (2011). Scholar
  2. 2.
    Damm, W., Harel, D.: LSCs: breathing life into message sequence charts. Formal Methods Syst. Des. 19(1), 45–80 (2001). Scholar
  3. 3.
    Damm, W., Horbach, M., Sofronie-Stokkermans, V.: Decidability of verification of safety properties of spatial families of linear hybrid automata. In: Lutz, C., Ranise, S. (eds.) FroCoS 2015. LNCS (LNAI), vol. 9322, pp. 186–202. Springer, Cham (2015). Scholar
  4. 4.
    Damm, W., Kemper, S., Möhlmann, E., Peikenkamp, T., Rakow, A.: Traffic sequence charts - from visualization to semantics. Reports of SFB/TR 14 AVACS 117, SFB/TR 14 AVACS, October 2017Google Scholar
  5. 5.
    Damm, W., Kemper, S., Möhlmann, E., Peikenkamp, T., Rakow, A.: Traffic sequence charts - a visual language for capturing traffic scenarios. In: Embedded Real Time Software and Systems - ERTS2018, February 2018Google Scholar
  6. 6.
    Damm, W., Peter, H., Rakow, J., Westphal, B.: Can we build it: formal synthesis of control strategies for cooperative driver assistance systems. Math. Struct. Comput. Sci. 23(4), 676–725 (2013). Scholar
  7. 7.
    Damm, W., Westphal, B.: Live and let die: LSC based verification of UML models. Sci. Comput. Program. 55(1–3), 117–159 (2005). Scholar
  8. 8.
    Fränzle, M.: What will be eventually true of polynomial hybrid automata? In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 340–359. Springer, Heidelberg (2001). Scholar
  9. 9.
    Fränzle, M., Hansen, M.R., Ody, H.: No need knowing numerous neighbours. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 152–171. Springer, Cham (2015). Scholar
  10. 10.
    Fränzle, M.: Analysis of hybrid systems: an ounce of realism can save an infinity of states. In: Flum, J., Rodriguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 126–139. Springer, Heidelberg (1999). Scholar
  11. 11.
    Harel, D., Marelly, R.: Come, Let’s Play: Scenario-Based Programming Using LSC’s and the Play-Engine. Springer, New York (2003). Scholar
  12. 12.
    Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? J. Comput. Syst. Sci. 57(1), 94–124 (1998)MathSciNetCrossRefGoogle Scholar
  13. 13.
    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). Scholar
  14. 14.
    Hilscher, M., Schwammberger, M.: An abstract model for proving safety of autonomous urban traffic. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 274–292. Springer, Cham (2016). Scholar
  15. 15.
    ITU-T: ITU-T recommendation Z.120: Message Sequence Chart (MSC) (2011).
  16. 16.
    Kemper, S., Etzien, C.: A visual logic for the description of highway traffic scenarios. In: Aiguier, M., Boulanger, F., Krob, D., Marchal, C. (eds.) Complex Systems Design and Management, pp. 233–245. Springer, Cham (2014). Scholar
  17. 17.
    Linker, S., Hilscher, M.: Proof theory of a multi-lane spatial logic. Log. Methods Comput. Sci. 11(3) (2015).
  18. 18.
    Lynch, N., Segala, R., Vaandrager, F.: Hybrid I/O automata. Inf. Comput. 185(1), 105–157 (2003). Scholar
  19. 19.
    Ody, H.: Undecidability results for multi-lane spatial logic. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 404–421. Springer, Cham (2015). Scholar
  20. 20.
    VIRES Simulationstechnologie GmbH: OpenDRIVE (2015). Accessed 07 Sept 2017
  21. 21.
    VIRES Simulationstechnologie GmbH: OpenCRG (2016). Accessed 07 Sept 2017
  22. 22.
    VIRES Simulationstechnologie GmbH: OpenSCENARIO (2017). Accessed 07 Sept 2017
  23. 23.
    Zhang, P., Grunske, L., Tang, A., Li, B.: A formal syntax for probabilistic timed property sequence charts. In: 2009 IEEE/ACM International Conference on Automated Software Engineering, pp. 500–504, November 2009Google Scholar
  24. 24.
    Zhang, P., Li, W., Wan, D., Grunske, L.: Monitoring of probabilistic timed property sequence charts. Softw.: Pract. Exp. 41(7), 841–866 (2011). Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Werner Damm
    • 1
    • 2
  • Eike Möhlmann
    • 1
  • Thomas Peikenkamp
    • 1
  • Astrid Rakow
    • 2
    Email author
  1. 1.OFFIS - Institute for Information TechnologyOldenburgGermany
  2. 2.Carl von Ossietzky University of OldenburgOldenburgGermany

Personalised recommendations