The algorithmic analysis of hybrid systems

Alur, Rajeev; Courcoubetis, Costas; Halbwachs, Nicolas; Henzinger, Thomas A.; Ho, Pei-Hsin; Nicollin, Xavier; Olivero, Alfredo; Sifakis, Joseph; Yovine, Sergio

doi:10.1016/0304-3975(94)00202-t

Cited by 1,518 publications

(1,106 citation statements)

References 8 publications

Supporting

Mentioning

1,081

Contrasting

Unclassified

Order By: Relevance

“…One of these specifications might contain a global description of the runs of a protocol while another view concentrates on realtime properties. In the following we shall assume that the realtime view is given by Hybrid Automata [2].…”

Section: Observer Models For Realtime Propertiesmentioning

confidence: 99%

See 1 more Smart Citation

Formal Requirements Engineering Using Observer Models

Nonnengart

Rock

Werner

2002

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. Today we are confronted with an enormous variety of formal software engineering approaches and tools. Among these are many that address the critical early stages of software development. However, only little attention has been paid to the integration of different specialised approaches and to the overall development process. In this paper we present a technique for formal requirements analysis (observer models) that deals with particular perspectives on a system rather than with particular aspects of it. A realistic gasburner example illustrates the overall approach.

show abstract

Section: Observer Models For Realtime Propertiesmentioning

confidence: 99%

“…A number of tools, like for example the one described in [9], have been used in this area. The real time view can be implemented by Hybrid Automata [2] or by Timed Automata [3]. Again, tools like HyTech [4] provide efficient techniques to establish real-time properties.…”

Section: Introductionmentioning

confidence: 99%

Formal Requirements Engineering Using Observer Models

Nonnengart

Rock

Werner

2002

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…If, in addition, this can be performed in a computationally feasible way, then one obtains classes of hybrid systems for which the reachability problem is decidable. This approach has successfully resulted in various decidable classes of hybrid systems, including timed automata [2], multirate automata [1], and initialized rectangular automata [6,9].…”

Section: Problem 1 (Reachability Problem)mentioning

confidence: 99%

“…For subclasses of hybrid systems, like multirate automata and rectangular automata [1], where the subsets of R n obtained by the application of the bisimulation algorithm are polyhedral sets, i.e., sets definable in the language of linear constraints P, the computation of P re(Y ) relies on the decidability of the theory Lin(R) via the elimination of the quantifiers.…”

Section: Linear Hybrid Systemsmentioning

confidence: 99%

“…If in addition, each step of the algorithm can be encoded and implemented by a computer program, then the problem is decidable. The first successful application of this approach was for the model of timed automata [2], and was then extended to multirate [1] and rectangular [6,9] automata. Unfortunately, the above decidable classes of hybrid systems have limited modeling power for most control applications, where systems with complicated continuous dynamics are frequently encountered.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A New Class of Decidable Hybrid Systems

Lafferriere

Pappas

Yovine

1999

Lecture Notes in Computer Science

155

119

View full text Add to dashboard Cite

Abstract.One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector fields in each discrete location. This result is achieved by showing that any such hybrid system admits a finite bisimulation, and by providing an algorithm that computes it using decision methods from mathematical logic.

show abstract

Distributed Software Engineering

Shatz

Wang

2002

Encyclopedia of Software Engineering

View full text Add to dashboard Cite

Distributed software engineering is an area of software engineering that is concerned with the development and the maintenance of reliable software for distributed systems. These systems are characterized by the presence of units that can be executed in parallel with respect to each other. In addition, these units communicate with one another by passing messages over a communication network rather than by sharing structures stored in common areas of memory.

show abstract

The algorithmic analysis of hybrid systems

Cited by 1,518 publications

References 8 publications

Formal Requirements Engineering Using Observer Models

Formal Requirements Engineering Using Observer Models

A New Class of Decidable Hybrid Systems

Distributed Software Engineering

Contact Info

Product

Resources

About