Logical analysis of hybrid systems: a complete answer to a complexity challenge

  • Authors:
  • André Platzer

  • Affiliations:
  • Computer Science Department, Carnegie Mellon University, Pittsburgh

  • Venue:
  • DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hybrid systems have a complete axiomatization in differential dynamic logic relative to continuous systems. They also have a complete axiomatization relative to discrete systems. Moreover, there is a constructive reduction of properties of hybrid systems to corresponding properties of continuous systems or to corresponding properties of discrete systems. We briefly summarize and discuss some of the implications of these results.