Learn More
— In this paper, we are interested in the diagnosis of discrete event systems modeled by finite transition systems. We propose a model of supervision patterns general enough to capture past occurrences of particular trajectories of the system. Modeling the diagnosis objective by a supervision pattern allows us to generalize the properties to be diagnosed(More)
On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, time is a crucial aspect of systems for practical applications, e.g. in the area of embedded systems. And yet, only few results exist on the design of timed component-based systems. In this(More)
In the application domain of component-based system design, developing theories which support compositional reasoning is notoriously challenging. We define timed modal specifications, an automata-based formalism combining modal and timed aspects. As a stepping stone to compo-sitional approaches of timed systems, we define the notions of refinement and(More)
Partial observation of discrete-event systems features a setting where events split into observable and unobservable ones. In this context, the diagnosis of a discrete-event system consists in detecting defects from the (partial) observation of its executions. Diagnosability is the property that any defect is eventually detected. Not surprisingly, it is a(More)
Modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. However, time is a crucial aspect of systems for practical applications, e.g. in the area of embedded systems. And yet, only few results exist on the design of timed component-based systems. In this paper, we propose a timed(More)
In this paper we present a sound and complete axiomatization of future event logic. Future event logic is a logic that generalizes a number of dynamic epistemic logics, by using a new operator that acts as a quantifier over the set of all refinements of a given model. (A refinement is like a bisimulation except that from the three relational requirements(More)
We propose meaning-preserving translations between L B , L U and L sb (three modal logics in full agreement with branching bisimulation), thus proving that they all have the same expressivity. The translations can be implemented and have potential applications in the automated analysis of reactive systems. In this work the main diiculty is that L B uses(More)
The emerging technology of interacting systems calls for new formalisms to ensure their reliability. Concurrent games are paradigmatic abstract models for which several logics have been studied. However, the existing formalisms show certain limitations in face of the range of strategy properties required to address intuitive situations. We propose a generic(More)