Sciweavers

69 search results - page 5 / 14
» Hybrid Systems with Finite Bisimulations
Sort
View
HYBRID
1999
Springer
13 years 11 months ago
A New Class of Decidable Hybrid Systems
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...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...
LICS
2006
IEEE
14 years 1 months ago
Control in o-minimal Hybrid Systems
In this paper, we consider the control of general hybrid systems. In this context we show that time-abstract bisimulation is not adequate for solving such a problem. That is why w...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
CDC
2008
IEEE
131views Control Systems» more  CDC 2008»
14 years 1 months ago
Probabilistic testing for stochastic hybrid systems
— In this paper we propose a testing based method for safety/ reachability analysis of stochastic hybrid systems. Testing based methods are characterized by analysis based on the...
A. Agung Julius, George J. Pappas
FORTE
2001
13 years 8 months ago
A Symbolic Semantics and Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to da...
Muffy Calder, Carron Shankland
HYBRID
2009
Springer
13 years 5 months ago
STORMED Hybrid Games
We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [21], which have natural specifications, allow rich continuous dynamics and admit various proper...
Vladimeros Vladimerou, Pavithra Prabhakar, Mahesh ...