Searching for authors named "Thomas Brihaye" – sorted by Relevance.
13 documents found, showing 1 through 10.
Next 10 →
-
Model-Checking for Weighted Timed Automata
- ……
- Cited by 7 (2 self) – Add To MetaCart
-
On the expressiveness and decidability of o-minimal hybrid systems
- …Abstract. This paper is driven by a general motto: bisimulate a hybrid system by a finite symbolic dynamical system. In the case of o-minimal hybrid systems, the continuous and discrete components can be decoupled, and hence, the problem reduces in building a finite symbolic dynamical system for the…
- Cited by 8 (5 self) – Add To MetaCart
-
On optimal timed strategies
- …Abstract. In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a strategy to force the game into T with a cost less than C no matter how Player 2 behaves. Recently, this problem…
- Cited by 7 (2 self) – Add To MetaCart
-
Control in o-minimal hybrid systems
- …In this paper, we consider the control of general hybrid systems. Surprisingly, time-abstract bisimulation is not fine enough for solving such a problem. Conversely, we show that suffix equivalence is a correct abstraction for that problem. We apply this equivalence to ominimal hybrid systems and ge…
- Cited by 1 (1 self) – Add To MetaCart
-
On the optimal reachability problem on weighted timed automata
- …Abstract. We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infimum cost as well as a supremum cost. We show that this problem is PSPACE-COMPLETE. Our proof uses techniques of…
- Cited by 1 (0 self) – Add To MetaCart
-
On model-checking timed automata with stopwatch observers
- …In this paper we study the model-checking problem for weighted timed automata and the weighted CTL logic; we also study the finiteness of bisimulations of weighted timed automata. Weighted timed automata are timed automata extended with costs on both edges and locations. When the costs act as stopwa…
- Cited by 2 (1 self) – Add To MetaCart
-
Weighted o-minimal hybrid systems are more decidable than weighted timed automata
- …Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables ” which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main resu…
- Cited by 1 (0 self) – Add To MetaCart
-
On the optimal reachability problem
- …Abstract. We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infimum cost as well as a supremum cost. We show that this problem is PSPACE-COMPLETE. Our proof uses techniques of…
- Cited by 2 (2 self) – Add To MetaCart
-
A Probabilistic Semantics for Timed Automata
- …Abstract. Like most models used in model-checking, timed automata are an ideal mathematical model to represent systems with strong timing requirements. In such mathematical models, properties can be violated, due to unlikely events. Following ideas of Varacca and Völzer [VV06], we aim at defining a …
- Add To MetaCart
-
Words and bisimulation of dynamical systems
- …In this paper we study bisimulations on dynamical systems through a given partition. Our aim is to give a new vision of the notion of bisimulation by using words. To achieve this goal, we encode the trajectories of the transition system as words. This method was introduced in our paper “On o-minimal…
- Cited by 4 (4 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
