Expressive power of hybrid systems with real variables, integer variables and arrays

Authors:
Ruggero Lanotte
Affiliations:
Dipartimento di Scienze della Cultura, Politiche e dell'Informazione, Università dell'Insubria, Como, Italy
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 11
Cited 0

A theory of timed automata

Theoretical Computer Science
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
Mixed real-integer linear quantifier elimination

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A Practical Decision Procedure for Arithmetic with Function Symbols

Journal of the ACM (JACM)
Automatic Symbolic Verification of Embedded Systems

IEEE Transactions on Software Engineering
Augmenting the discrete timed automaton with other data structures

Theoretical Computer Science
What Will Be Eventually True of Polynomial Hybrid Automata?

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures

Hybrid Systems II
Information flow in hybrid systems

ACM Transactions on Embedded Computing Systems (TECS)
Timed Automata with Data Structures for Distributed Systems Design and Analysis

SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid systems is a suitable model to describe systems composed of both continuous and discrete components. The continuous components typically represent physic events. The discrete components are logic devices, such as switches and digital circuitry. A typical example is a system where physical processes are controlled by embedded controllers. Different classes of hybrid systems have been proposed. In this paper we consider hybrid systems equipped with real variable (as usual), integer variables and unbounded arrays. We study the expressive power of five classes: Linear real hybrid systems, Polynomial real hybrid systems, Mixed hybrid systems, D-hybrid systems and S-Hybrid systems. For these classes there exists a quantifier elimination technique for computing the successor operator, hence the reachability problem is semidecidable.