The diagnosability problem can be stated as follows: does a given labeled Discrete Event System allow for an outside observer to determine the occurrence of the “invisible” fault, no later than a… (More)

We show that the diagnosability problem on a Petri net can be re-formulated in terms of LTL-X model checking. The advantage of this is that existing efficient methods and tools can be employed, in… (More)

Studying diagnosability of systems represents an important domain which has drawn in the last years the attention of many researchers in both arti cial intelligence and control theory communities.… (More)

We show that the predictability problem for a Petri net can be reduced to LTL-X model checking. The advantage of this is that existing efficient methods and tools can be employed, in particular… (More)

Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolving state coding conflicts. The refinement process is generally done automatically using heuristics and often… (More)

2011 30th International Conference of the Chilean…

2011

A discrete event system that is predictable can anticipate faults and act accordingly. However, bare predictability (as found in the literature) has some drawbacks. One does not know exactly when a… (More)

An interactive synthesis of asynchronous circuits from Signal Transition Graphs (STGs) based on partial order semantics is presented. In particular, the fundamental problem of encoding con icts in… (More)

The tool supports manual resolution of coding conflicts in asynchronous circuit specification given as Signal Transition Graphs (STGs) and displays them as partial orders (finite and complete… (More)

We propose a framework to distributed diagnosability analysis of concurrent systems modeled with Petri nets as a collection of components synchronizing on common observable transitions, where faults… (More)