A Framework for Supervisory Control of Probabilistic Discrete Event Systems

Pantelic, Vera; Lawford, Mark; Postma, Steven

doi:10.3182/20140514-3-fr-4046.00073

Cited by 3 publications

(2 citation statements)

References 17 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, appropriate bisimulation relations for masking, nonmasking, and failsafe fault-tolerance also need to be extended, where each kind of fault occurs with a certain probability. A good basis for extending our work to this setting is the work of Pantelic et al in [Vera Pantelic, 2014].…”

Section: Future Workmentioning

confidence: 99%

Synthesizing fault-tolerant programs from deontic logic specifications

Demasi

2013

2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

This dissertation concentrates on the problem of synthesizing fault-tolerant components from specifications, i.e., the problem of automatically constructing a faulttolerant component implementation from a logical specification of the component, and the system's required level of fault-tolerance. In our approach, the logical specification of the component is given in dCTL-, a fragment of a branching time temporal logic with deontic operators, especially designed for fault-tolerant component specification. Deontic logics have proved to be useful for reasoning about legal and moral systems, where the situation is more or less similar to fault-tolerance: there exists a set of rules that states what the normal behaviours or scenarios are. Violations arise when these rules are not followed and, as a consequence, some actions must be performed to return to a normal or desirable state.As a black-box overview, our synthesis algorithm takes the component specification and a user-defined level of fault-tolerance (masking, nonmasking, or failsafe), and automatically determines whether a component with the required fault-tolerance is realizable. Moreover, if the answer is positive, then the algorithm produces such a fault-tolerant implementation. Our technique for synthesis is based on the use of (bi)simulation algorithms for capturing different fault-tolerance classes, and the extension of a synthesis algorithm for CTL to cope with dCTL-specifications.Some case studies are provided throughout this thesis to illustrate how the ideas described below can be applied in practice. Moreover, we have implemented a tool called dCTL Synthesizer (syntdctl) which was used to synthesize automatically wellknown fault-tolerant examples.iv

show abstract

Section: Future Workmentioning

confidence: 99%

Synthesizing fault-tolerant programs from deontic logic specifications

Demasi

2013

2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

show abstract

“…Supervisory control community has also shown interest in defining frameworks for dealing with plants and properties based on probabilistic languages (e.g. [29], [28], [34]) or stochastic process-theoretic approaches (e.g. [31]).…”

Section: Algorithmmentioning

confidence: 99%

2½-player generalized reactivity (1) games

Rodrı́guez

Braberman

D’Ippolito

et al. 2016

2016 IEEE 55th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

Abstract-We introduce a new class of 2 1 /2-player games, the 2 1 /2-player GR(1) games, that allows for solving problems of stochastic nature by adding a probabilistic component to simple 2-player GR(1) games. Further, we present an efficient approach for solving qualitative 2 1 /2-player GR(1) games with polynomial-time complexity. Our approach is based on a reduction from 2 1 /2-player GR(1) games to 2-player GR(1) games that allows for solving the game and constructing, from a sure winning strategy for player 2 (resp. 3) in a 2-player GR (1) game, an almost-sure (resp. positively) winning strategy for its corresponding 2 1 /2-player GR(1) game. Key to the effectiveness of the proposed approach is the fact that the reduction generates a 2-player game that is linearly larger than the original 2 1 /2-player game, more precisely, it is linear with respect to the number of probabilistic states in the 2 1 /2-player GR(1) game.

show abstract