Combinatorial Abstractions of Dynamical Systems

Rafael Wisniewski
(Aalborg University)

Formal verification has been successfully developed in computer science for verifying combinatorial classes of models and specifications. In like manner, formal verification methods have been developed for dynamical systems. However, the verification of system properties, such as safety, is based on reachability calculations, which are the sources of insurmountable complexity. This talk addresses indirect verification methods, which are based on abstracting the dynamical systems by models of reduced complexity and preserving central properties of the original systems.

Invited Presentation in Luca Bortolussi, Manuela L. Bujorianu and Giordano Pola: Proceedings Third International Workshop on Hybrid Autonomous Systems (HAS 2013), Rome, 17th March 2013, Electronic Proceedings in Theoretical Computer Science 124, pp. 5–8.
Published: 22nd August 2013.

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