10 citations · 32 across the 26 of their papers we have counts for
6 papers · 1 filter
Decentralized Observation of Discrete-Event Systems: At Least One Can Tell
Stavros Tripakis, Karen Rudie
We introduce a new decentralized observation condition which we call "at least one can tell" (OCT) and which attempts to capture the idea that for any possible behavior that a syst…
Runtime enforcement of reactive systems using synchronous enforcers
Srinivas Pinisetty, Partha S Roop, Steven Smyth +2
Synchronous programming is a paradigm of choice for the design of safety-critical reactive systems. Runtime enforcement is a technique to ensure that the output of a black-box syst…
Learning Moore Machines from Input-Output Traces
Georgios Giantamidis, Stavros Tripakis
The problem of learning automata from example traces (but no equivalence or membership queries) is fundamental in automata learning theory and practice. In this paper we study this…
Automatic Completion of Distributed Protocols with Symmetry
Rajeev Alur, Mukund Raghothaman, Christos Stergiou +2
A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions, and i…
Synthesizing Finite-state Protocols from Scenarios and Requirements
Rajeev Alur, Milo Martin, Mukund Raghothaman +3
Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite…
Fault Diagnosis with Dynamic Observers
Franck Cassez, Stavros Tripakis
In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser…