Combinatorial Abstractions of Dynamical Systems

Autor:	Wisniewski, Rafael
Rok vydání:	2013
Předmět:	Computer Science - Systems and Control Computer Science - Logic in Computer Science B.5.3 B.2.2 B.1.4 I.2.8
Zdroj:	EPTCS 124, 2013, pp. 5-8
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.124.2
Popis:	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. Comment: In Proceedings HAS 2013, arXiv:1308.4904
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1308.5330 Zobrazit plný text záznamu View this record from Arxiv