Florent Peres

Learn More
In a companion paper [BPV06], we investigated the expres-siveness of Time Petri Nets extended with Priorities and showed that it is very close to that Timed Automata, in terms of weak timed bisimilar-ity. As a continuation of this work we investigate here the applicability of the available state space abstractions for Bounded Time Petri Nets to Bounded(More)
Diagnosability is a procedure whose goal is to determine whether any failure – or a class of failures – can be determined in finite time after its occurrence. Earlier works on diagnosability of discrete event systems (DES) establish some intermediary models from the analyzed model and then call some procedures to check diagnosablity based on these models,(More)
Systems' requirements are usually written in a natural language since it generally means a greater understanding among the various stakeholders. However, using an informal language potentially gives rise to interpretation problems, which are to be resolved prior to using (automated) verification techniques. This article tackles an important issue pertaining(More)
Finding an infinite sequence of transitions (a run) going through some special states (called accepting) is of importance for fields like formal verification. Whereas finding such a sequence as been extensively studied, the problem of maintaining this sequence upon changes in the model or the specification has received less attention. In this work, we(More)