An extension of Java PathFinder for hybrid systems

Authors:
Laura Panizo;María del Mar Gallardo
Affiliations:
University of Málaga, Spain;University of Málaga, Spain
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
2012

Citing 4
Cited 0

What's decidable about hybrid automata?

Journal of Computer and System Sciences
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Scheduling a Steel Plant with Timed Automata

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid systems are characterized by combining discrete and continuous behaviors. Verification of hybrid systems is, in general, a diffcult task due to the potential complexity of the continuous dynamics. Currently, there are different formalisms and tools which are able to analyze specific types of hybrid systems, model checking being one of the most used approaches. In this paper, we describe an extension of Java PathFinder in order to analyze hybrid systems. We apply a general methodology which has been successfully used to extend Spin. This methodology is non-intrusive, and uses external libraries, such as the Parma Polyhedra Library, to abstract the continuous behavior of the hybrid system.