#### Filter Results:

- Full text PDF available (39)

#### Publication Year

2005

2017

- This year (2)
- Last 5 years (23)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
- ICALP
- 2006

Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incompara-ble for the timed language equivalence. Thus we propose an extension of timed Petri nets with read-arcs (RA-TdPN), whose coverability problem is decidable. We also show that this model unifies timed Petri nets… (More)

In this paper, we show how to apply recent tools for the automatic synthesis of robust and near-optimal controllers for a real industrial case study. We show how to use three different classes of models and their supporting existing tools, UPPAAL-TIGA for synthesis, PHAVER for verification, and SIMULINK for simulation, in a complementary way. We believe… (More)

- Pierre-Alain Reynier, Frédéric Servais
- Fundam. Inform.
- 2011

This paper presents the Monotone-Pruning algorithm (MP) for computing the minimal coverability set of Petri nets. The original Karp and Miller algorithm (K&M) unfolds the reachability graph of a Petri net and uses acceleration on branches to ensure termination. The MP algorithm improves the K&M algorithm by adding pruning between branches of the K&M tree.… (More)

- Pierre-Alain Reynier, Arnaud Sangnier
- CONCUR
- 2009

We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are urgent, and the weak one, for which time can elapse arbitrarily. It is well known that many verification problems such as the marking reachability are undecidable with the strong… (More)

- Emmanuel Filiot, Pierre-Alain Reynier
- ArXiv
- 2014

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Cerny in 2010 as a one-way de-terministic automata model to define transformations of finite strings. Copyless SST extend deterministic finite state automata with a set of registers in which to store intermediate output strings, and those registers can be combined… (More)

- Pierre-Alain Reynier, Jean-Marc Talbot
- Int. J. Found. Comput. Sci.
- 2014

Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. When outputs are also struc-tured and well nested words, VPTs are a natural formalism to express tree transformations evaluated in streaming. We prove the class… (More)

- Emmanuel Filiot, Pierre-Alain Reynier
- SIGLOG News
- 2016

The robust theory of regular languages is based on three important pillars: computation (automata), logic, and algebra. In this paper, we survey old and recent results on extensions of these pillars to functions from words to words. We consider two important classes of word functions, the rational and regular functions, respectively defined by one-way and… (More)

- Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
- LATIN
- 2006

Formal verification of timed systems is well understood, but their implementation is still challenging. Raskin et al. have recently brought out a model of parameterized timed automata in which the transitions might be slightly delayed or expedited. This model is used to prove that a timed system is implementable with respect to a safety property, by proving… (More)

- Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
- FoSSaCS
- 2008

Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Several works have thus focused on a modified semantics of timed automata which ensures implementability, and robust model-checking algorithms for safety, and later LTL properties… (More)

- Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier
- FORMATS
- 2005

Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability properties. Though diagonal constraints do not add expressive power to classical TA, the standard forward analysis algorithm is not correct for this model. In this paper we… (More)