#### Filter Results:

- Full text PDF available (59)

#### Publication Year

2004

2017

- This year (4)
- Last 5 years (26)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the strategies being executed… (More)

- Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
- FORMATS/FTRTFT
- 2004

We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with costs on both edges… (More)

- Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
- Formal Methods in System Design
- 2007

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… (More)

This paper is driven by a general motto: bisimulate an hybrid system by a finite symbolic dynamical system. In the case of ominimal hybrid systems, the continuous and discrete components can be… (More)

- Patricia Bouyer, Thomas Brihaye, Nicolas Markey
- Inf. Process. Lett.
- 2006

In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we propose new encodings of… (More)

- Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
- 21st Annual IEEE Symposium on Logic in Computer…
- 2006

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 we consider other… (More)

- Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
- LFCS
- 2007

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… (More)

This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time… (More)

We study the time-bounded reachability problem for monotonic hybrid automata (MHA), i.e., rectangular hybrid automata for which the rate of each variable is either always non-negative or always… (More)

- Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye
- ICALP
- 2009

In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition,… (More)