Bridging the Gap between Reactive Synthesis and Supervisory Control
|
|
- Roderick Lane
- 5 years ago
- Views:
Transcription
1 Bridging the Gap between Reactive Synthesis and Supervisory Control Stavros Tripakis University of California, Berkeley Joint work with Ruediger Ehlers (Berkeley, Cornell), Stéphane Lafortune (Michigan) and Moshe Vardi (Rice) ExCAPE PI Meeting June 2013 ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 1 / 26
2 Classic Synthesis Frameworks Reactive synthesis: From declarative specifications (e.g., LTL formulas) to implementations (e.g., Mealy or Moore state machines). On the Synthesis of a Reactive Module [Pnueli-Rosner, POPL 89], but also earlier, e.g., [Church 63]. See Moshe s summer school tutorial for details. Supervisory control: Feedback control for discrete-event systems (DES). Supervisory control of a class of discrete event processes and On the supremal controllable sublanguage of a given language [Ramadge-Wonham, SIAM J. Control Optim. 87]. See Stéphane s textbook for more [Cassandras & Lafortune 08]. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 2 / 26
3 This Work Bridge the gap: how are the two frameworks related in theory? in practice? Bridge the communities. Pedagogical, although results are new to our knowledge. Work in progress. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 3 / 26
4 Agenda Supervisory control. Reactive synthesis. Bridging the gap. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 4 / 26
5 Agenda Supervisory control. Reactive synthesis. Bridging the gap. More details in summer school talk. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 4 / 26
6 SUPERVISORY CONTROL ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 5 / 26
7 Supervisory Control: General Framework Supervisory control problems (in general) Given plant G, synthesize (if possible) supervisor S such that the closed-loop system S/G meets a certain specification. Closed-loop system: Supervisor S S/G: Plant G ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 6 / 26
8 Supervisory Control: General Framework closed-loop system S/G: events Supervisor S disabling actions Plant G Plant generally modeled as discrete event system (DES): regular language, deterministic finite automaton (G). ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 7 / 26
9 Supervisory Control: General Framework closed-loop system S/G: events Supervisor S disabling actions Plant G Plant generally modeled as discrete event system (DES): regular language, deterministic finite automaton (G). Supervisor (S) can disable controllable events. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 7 / 26
10 Supervisory Control: General Framework events disabling Supervisor S actions closed-loop system S/G: Plant G Plant generally modeled as discrete event system (DES): regular language, deterministic finite automaton (G). Supervisor (S) can disable controllable events. Specifications vary, but typically: Safety: all behaviors of the closed-loop system must be in some set of good behaviors. Non-blockingness: supervisor must always allow system to reach an accepting (aka marked ) state. Maximal permissiveness: supervisor must not disable more events than strictly necessary. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 7 / 26
11 Supervisor Synthesis: a basic problem Simple Supervisory Control Problem (SSCP) Given plant G, synthesize (if possible) supervisor S such that: S is non-blocking. S is maximally-permissive, that is, for any other non-blocking supervisor S : L m (S /G) L m (S/G) ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 8 / 26
12 Supervisor Synthesis: a basic problem Simple Supervisory Control Problem (SSCP) Given plant G, synthesize (if possible) supervisor S such that: S is non-blocking. S is maximally-permissive, that is, for any other non-blocking supervisor S : L m (S /G) L m (S/G) We proved: Can reduce the standard supervisory control problem (safety and non-blocking) to SSCP (non-blocking only). ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 8 / 26
13 Supervisor Synthesis: a basic problem Simple Supervisory Control Problem (SSCP) Given plant G, synthesize (if possible) supervisor S such that: S is non-blocking. S is maximally-permissive, that is, for any other non-blocking supervisor S : L m (S /G) L m (S/G) We proved: Can reduce the standard supervisory control problem (safety and non-blocking) to SSCP (non-blocking only). Can show that if a non-blocking supervisor exists, then the maximally-permissive non-blocking supervisor is unique and state-based ( memoryless ). ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 8 / 26
14 Supervisory Control of DES Much more to the story: Partial observability Decentralized, distributed, hierarchical control architectures ω-regular frameworks Supervisory control of DES modeled as Petri nets Not only control: Monitoring, fault diagnosis (partial observation)... Application areas: Automated systems in control engineering: manufacturing, transportation, process control, etc. Recently: Controlling execution of software for avoiding deadlocks in multithreaded programs [Wang et al. POPL 09]. (Cf. summer school lecture of Stéphane.) ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 9 / 26
15 REACTIVE SYNTHESIS ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 10 / 26
16 Reactive Synthesis Reactive Synthesis Problem (RSP) Given LTL formula φ with input/output atomic propositions, synthesize (if possible) a controller M (Moore or Mealy machine) such that all behaviors of M (inputs are uncontrollable) satisfy φ. This is the implementability problem [Pnueli-Rosner POPL 1989]. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 11 / 26
17 RSP Specification: (G: always, X: next) φ := G (c ( Xg XXg XXX(b g) )) ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 12 / 26
18 RSP Specification: (G: always, X: next) φ := G (c ( Xg XXg XXX(b g) )) g Controller interface: c Controller b ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 12 / 26
19 RSP Specification: (G: always, X: next) φ := G (c ( Xg XXg XXX(b g) )) g Controller interface: c Controller b Controller generates a computation tree: all its paths must satisfy φ {g false, b false} {c false} {g false, b false} {c true} {g true, b false} {g false, b false} {g true, b false} {g true, b false} {g true, b false} {g false, {g false, b true} b true} {g false, {g false, b true} b true} ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 12 / 26
20 BRIDGING THE GAP ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 13 / 26
21 Summary: Main Differences Supervisory control has explicit plants reactive synthesis does not. Supervisors are parents controllers are... controllers. Supervisory control asks for maximally-permissive controllers these generally don t exist in reactive synthesis. (Most of) supervisory control theory done in a finite-string setting reactive synthesis is about infinite strings. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 14 / 26
22 Controllers, Plants and Closed-Loop Systems in the Reactive Synthesis Framework inputs Controller outputs ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 15 / 26
23 Controllers, Plants and Closed-Loop Systems in the Reactive Synthesis Framework inputs outputs? Controller? ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 15 / 26
24 Controllers, Plants and Closed-Loop Systems in the Reactive Synthesis Framework inputs Controller outputs Plant (Environment) ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 15 / 26
25 Controllers, Plants and Closed-Loop Systems in the Reactive Synthesis Framework inputs Controller outputs Plant (Environment) How to capture plants in the reactive synthesis framework? ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 15 / 26
26 Capturing Plants in RSP Instead of asking for a controller implementing φ we can ask for a controller implementing φ plant φ where φ plant models the plant. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 16 / 26
27 Capturing Plants in RSP Example: plant never issues two p s in a row φ plant := G(p X p) ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 17 / 26
28 Capturing Plants in RSP Example: plant never issues two p s in a row φ plant := G(p X p) However: Not always natural to capture the plant s behavior: plant typically modeled as an automaton. Inefficient to do so: most synthesis algorithms start by transforming the formula into some automaton form. This typically incurs an exponential blow-up. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 17 / 26
29 Capturing Plants in RSP Example: plant never issues two p s in a row φ plant := G(p X p) However: Not always natural to capture the plant s behavior: plant typically modeled as an automaton. Inefficient to do so: most synthesis algorithms start by transforming the formula into some automaton form. This typically incurs an exponential blow-up. motivation to define a reactive synthesis problem with plants ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 17 / 26
30 Reactive Synthesis with Plants Inspired from [Kupferman et al CONCUR 2000]: Reactive Synthesis Control Problem (RSCP) Given plant P and temporal logic formula φ synthesize (if possible) a strategy f such that the closed-loop system satisfies φ. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 18 / 26
31 Reactive Synthesis with Plants Inspired from [Kupferman et al CONCUR 2000]: Reactive Synthesis Control Problem (RSCP) Given plant P and temporal logic formula φ synthesize (if possible) a strategy f such that the closed-loop system satisfies φ. Plant modeled as a transition system with system states and environment states. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 18 / 26
32 Reactive Synthesis with Plants Inspired from [Kupferman et al CONCUR 2000]: Reactive Synthesis Control Problem (RSCP) Given plant P and temporal logic formula φ synthesize (if possible) a strategy f such that the closed-loop system satisfies φ. Plant modeled as a transition system with system states and environment states. Strategy disables some successors of system states. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 18 / 26
33 Reactive Synthesis with Plants Inspired from [Kupferman et al CONCUR 2000]: Reactive Synthesis Control Problem (RSCP) Given plant P and temporal logic formula φ synthesize (if possible) a strategy f such that the closed-loop system satisfies φ. Plant modeled as a transition system with system states and environment states. Strategy disables some successors of system states. Different versions of the problem depending on the temporal logic used: RSCP-LTL, RSCP-CTL, RSCP-CTL*,... ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 18 / 26
34 Maximal Permissiveness in RSCP Generally no unique maximally-permissive strategy. Example: no unique maximally-permissive strategy to ensure Fp: p p p original plant strategy 1 strategy 2 : system state : environment state ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 19 / 26
35 Maximal Permissiveness in RSCP Generally no unique maximally-permissive strategy. Example: no unique maximally-permissive strategy to ensure Fp: p p p original plant strategy 1 strategy 2 : system state : environment state Many other (non-state-based) strategies. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 19 / 26
36 Maximal Permissiveness in RSCP-CTL Yet for some formulas maximally-permissive strategies always exist: Theorem For any CTL formula φ := AG EF p, where p is a state formula, RSCP admits a unique maximally-permissive state-based strategy enforcing φ (if such a strategy exists). ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 20 / 26
37 Maximal Permissiveness in RSCP-CTL Yet for some formulas maximally-permissive strategies always exist: Theorem For any CTL formula φ := AG EF p, where p is a state formula, RSCP admits a unique maximally-permissive state-based strategy enforcing φ (if such a strategy exists). We therefore define a variant of RSCP-CTL: RSCP-CTL max Given plant P and CTL φ := AG EF p compute (if it exists) the unique maximally-permissive state-based strategy enforcing φ. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 20 / 26
38 Results Relations between different synthesis problems: Section 3.4 Corollary 1 Theorem 5 RSCP-LTL BSCP-NB SSCP RSCP-CTL max RSP special case Section 3.5 supervisory control problems reactive synthesis problems Cf. technical report under preparation. : work in progress ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 21 / 26
39 Results Relations between different synthesis problems: Section 3.4 Corollary 1 Theorem 5 RSCP-LTL BSCP-NB SSCP RSCP-CTL max RSP special case Section 3.5 supervisory control problems reactive synthesis problems Cf. technical report under preparation. : work in progress ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 21 / 26
40 Reducing SSCP to RSCP-CTL max Main idea: DES can be transformed to a transition system. Marked states labeled with atomic proposition acc. Non-blockingness can be expressed in CTL: φ nb := AG EF acc i.e., from any reachable state, there exists a path to an accepting state. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 22 / 26
41 Reducing SSCP to RSCP-CTL max : Example x 1, u x 1 x 1 x 0, c 1 x 3, c 2 x 0 c 1 c 2 x 2 u c 1 c 2 x 3 x0 x0, u x 0, c 2 x 3 x 2 x 3, u x 3, c 1 DES G x 2, u Transition system P G : system state : environment state ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 23 / 26
42 Reducing SSCP to RSCP-CTL max Theorem Let G be a DES plant and P G its transformation. 1. A non-blocking supervisor exists for G iff a strategy enforcing φ nb := AG EF acc exists for P G. 2. Assuming supervisor/strategy exist, there is a 1-1 computable mapping between the unique non-blocking maximally-permissive state-based supervisor for G, and the unique maximally-permissive state-based strategy enforcing φ nb on P G. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 24 / 26
43 Conclusions and Perspectives First (to our knowledge) bridge between the reactive synthesis and DES/supervisory control problems and communities. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 25 / 26
44 Conclusions and Perspectives First (to our knowledge) bridge between the reactive synthesis and DES/supervisory control problems and communities. This work would not have happened without ExCAPE! ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 25 / 26
45 Conclusions and Perspectives First (to our knowledge) bridge between the reactive synthesis and DES/supervisory control problems and communities. This work would not have happened without ExCAPE! Merely scratched the surface; expand bridge to: Partial observability. Modular, decentralized, hierarchical control architectures. Algorithmic procedures. ω-regular supervisory control theory (cf. [Thistle 96]). Supervisory control of Petri nets. ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 25 / 26
46 Bibliography C. Cassandras and S. Lafortune. Introduction to Discrete Event Systems. Springer, Boston, MA, 2nd edition, A. Church. Logic, arithmetic and automata. In Proceedings of the International Congress of Mathematics, O. Kupferman, P. Madhusudan, P. S. Thiagarajan, and M. Y. Vardi. Open systems in reactive environments: Control and synthesis. In 11th Intl. Conf. on Concurrency Theory, CONCUR 00, pages Springer, A. Pnueli and R. Rosner. On the synthesis of a reactive module. In ACM Symp. POPL, P. Ramadge and W. Wonham. Supervisory control of a class of discrete event processes. SIAM J. Control Optim., 25(1): , J.G. Thistle. Supervisory control of discrete event systems. Mathl. Comput. Modelling, 23(11/12):25 53, Y. Wang, S. Lafortune, T. Kelly, M. Kudlur, and S. Mahlke. The theory of deadlock avoidance via discrete control. In ACM Symp. POPL, pages , W. Wonham and P. Ramadge. On the supremal controllable sublanguage of a given language. SIAM J. Control Optim., 25(3): , ExCAPE PI Meeting June 2013 Stavros Tripakis (UC Berkeley) Bridging the Gap 26 / 26
Temporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
More informationOptimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency
Optimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency Vahid Saeidi a, Ali A. Afzalian *b, Davood Gharavian c * Phone +982173932626, Fax +982177310425 a,b,c Department of Electrical
More informationSynthesis of Maximally Permissive Non-blocking Supervisors for Partially Observed Discrete Event Systems
53rd IEEE Conference on Decision and Control December 5-7, 24. Los Angeles, California, USA Synthesis of Maximally Permissive Non-blocking Supervisors for Partially Observed Discrete Event Systems Xiang
More informationA look at the control of asynchronous automata
A look at the control of asynchronous automata 1 1 Introduction Anca Muscholl, Igor Walukiewicz and Marc Zeitoun LaBRI Bordeaux Universtity, France In the simplest case, the controller synthesis problem
More informationState-Space Exploration. Stavros Tripakis University of California, Berkeley
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2014 State-Space Exploration Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE
More informationSupervisory control under partial observation is an important problem
2576 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 62, NO. 5, MAY 2017 Technical Notes and Correspondence Supervisor Synthesis for Mealy Automata With Output Functions: A Model Transformation Approach Xiang
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationSupervisory Control: Advanced Theory and Applications
Supervisory Control: Advanced Theory and Applications Dr Rong Su S1-B1b-59, School of EEE Nanyang Technological University Tel: +65 6790-6042, Email: rsu@ntu.edu.sg EE6226, Discrete Event Systems 1 Introduction
More informationSynthesis of Designs from Property Specifications
Synthesis of Designs from Property Specifications Amir Pnueli New York University and Weizmann Institute of Sciences FMCAD 06 San Jose, November, 2006 Joint work with Nir Piterman, Yaniv Sa ar, Research
More informationFinite-State Model Checking
EECS 219C: Computer-Aided Verification Intro. to Model Checking: Models and Properties Sanjit A. Seshia EECS, UC Berkeley Finite-State Model Checking G(p X q) Temporal logic q p FSM Model Checker Yes,
More informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication 1
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication 1 Stavros Tripakis 2 VERIMAG Technical Report TR-2004-26 November 2004 Abstract We introduce problems of decentralized
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationEECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization
EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Discrete Systems Lecture: Automata, State machines, Circuits Stavros Tripakis University of California, Berkeley Stavros
More informationAsynchronous Games over Tree Architectures
Asynchronous Games over Tree Architectures Blaise Genest 1, Hugo Gimbert 2, Anca Muscholl 2, Igor Walukiewicz 2 1 IRISA, CNRS, Rennes, France 2 LaBRI, CNRS/Université Bordeaux, France Abstract. We consider
More informationOn the Design of Adaptive Supervisors for Discrete Event Systems
On the Design of Adaptive Supervisors for Discrete Event Systems Vigyan CHANDRA Department of Technology, Eastern Kentucky University Richmond, KY 40475, USA and Siddhartha BHATTACHARYYA Division of Computer
More informationGames and Synthesis. Nir Piterman University of Leicester Telč, July-Autugst 2014
Games and Synthesis Nir Piterman University of Leicester Telč, July-Autugst 2014 Games and Synthesis, EATCS Young Researchers School, Telč, Summer 2014 Games and Synthesis, EATCS Young Researchers School,
More informationBisimulation, the Supervisory Control Problem and Strong Model Matching for Finite State Machines
Discrete Event Dynamic Systems: Theory and Applications, 8, 377 429 (1998) c 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Bisimulation, the Supervisory Control Problem and
More informationSemi-Automatic Distributed Synthesis
Semi-Automatic Distributed Synthesis Bernd Finkbeiner and Sven Schewe Universität des Saarlandes, 66123 Saarbrücken, Germany {finkbeiner schewe}@cs.uni-sb.de Abstract. We propose a sound and complete compositional
More informationFORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES 1 R. D. Brandt 2,V.Garg 3,R.Kumar 3,F.Lin 2,S.I.Marcus 3, and W. M.
FORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES 1 R. D. Brandt 2,V.Garg 3,R.Kumar 3,F.Lin 2,S.I.Marcus 3, and W. M. Wonham 4 2 Department of ECE, Wayne State University, Detroit,
More informationOn Controllability and Normality of Discrete Event. Dynamical Systems. Ratnesh Kumar Vijay Garg Steven I. Marcus
On Controllability and Normality of Discrete Event Dynamical Systems Ratnesh Kumar Vijay Garg Steven I. Marcus Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin,
More informationDecentralized Control of Discrete Event Systems with Multiple Local Specializations 1
Decentralized Control of Discrete Event Systems with Multiple Local Specializations Shengbing Jiang, Vigyan Chandra, Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington,
More informationRepresentation of Supervisory Controls using State Tree Structures, Binary Decision Diagrams, Automata, and Supervisor Reduction
Representation of Supervisory Controls using State Tree Structures, Binary Decision Diagrams, Automata, and Supervisor Reduction Wujie Chao 1, Yongmei Gan 2, Zhaoan Wang 3, W. M. Wonham 4 1. School of
More informationA Symbolic Approach to Safety LTL Synthesis
A Symbolic Approach to Safety LTL Synthesis Shufang Zhu 1 Lucas M. Tabajara 2 Jianwen Li Geguang Pu 1 Moshe Y. Vardi 2 1 East China Normal University 2 Rice Lucas M. Tabajara (Rice University) 2 University
More informationDECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES. Wenbin Qiu and Ratnesh Kumar
DECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES Wenbin Qiu and Ratnesh Kumar Department of Electrical and Computer Engineering Iowa State University Ames, IA 50011, U.S.A.
More informationStéphane Lafortune. August 2006
UNIVERSITY OF MICHIGAN DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE LECTURE NOTES FOR EECS 661 CHAPTER 1: INTRODUCTION TO DISCRETE EVENT SYSTEMS Stéphane Lafortune August 2006 References for
More informationFailure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications
Failure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications Shengbing Jiang and Ratnesh Kumar Abstract The paper studies failure diagnosis of discrete event systems with
More informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication Stavros Tripakis Abstract We introduce problems of decentralized control with communication, where we explicitly
More informationLinear Time Logic Control of Discrete-Time Linear Systems
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering December 2006 Linear Time Logic Control of Discrete-Time Linear Systems Paulo Tabuada
More informationA Logic Primer. Stavros Tripakis University of California, Berkeley. Stavros Tripakis (UC Berkeley) EE 144/244, Fall 2014 A Logic Primer 1 / 35
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2014 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationAchieving Fault-tolerance and Safety of Discrete-event Systems through Learning
2016 American Control Conference (ACC) Boston Marriott Copley Place July 6-8, 2016. Boston, MA, USA Achieving Fault-tolerance and Safety of Discrete-event Systems through Learning Jin Dai, Ali Karimoddini,
More informationBounded Synthesis. Sven Schewe and Bernd Finkbeiner. Universität des Saarlandes, Saarbrücken, Germany
Bounded Synthesis Sven Schewe and Bernd Finkbeiner Universität des Saarlandes, 66123 Saarbrücken, Germany Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given
More informationRobust Supervisory Control of a Spacecraft Propulsion System
1 Robust Supervisory Control of a Spacecraft Propulsion System Farid Yari, Shahin Hashtrudi-Zad*, and Siamak Tafazoli In this paper the theory of supervisory control of discrete-event systems is used to
More informationOn Supervisory Control of Concurrent Discrete-Event Systems
On Supervisory Control of Concurrent Discrete-Event Systems Yosef Willner Michael Heymann March 27, 2002 Abstract When a discrete-event system P consists of several subsystems P 1,..., P n that operate
More informationLanguage Stability and Stabilizability of Discrete Event Dynamical Systems 1
Language Stability and Stabilizability of Discrete Event Dynamical Systems 1 Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Vijay Garg Department of
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
More informationof Kentucky, Lexington, KY USA,
Controlled Petri Nets: A Tutorial Survey L. E. Holloway 1 and B. H. Krogh 2 1 Center for Manufacturing Systems and Dept. of Electrical Engineering, University of Kentucky, Lexington, KY 40506-0108 USA,
More informationSUPERVISORY CONTROL AND FAILURE DIAGNOSIS OF DISCRETE EVENT SYSTEMS: A TEMPORAL LOGIC APPROACH
University of Kentucky UKnowledge University of Kentucky Doctoral Dissertations Graduate School 2002 SUPERVISORY CONTROL AND FAILURE DIAGNOSIS OF DISCRETE EVENT SYSTEMS: A TEMPORAL LOGIC APPROACH Shengbing
More informationA Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems
A Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems Jin Dai, Ali Karimoddini and Hai Lin Abstract A fault-tolerant controller is a controller that drives the plant to satisfy
More informationAlternating Time Temporal Logics*
Alternating Time Temporal Logics* Sophie Pinchinat Visiting Research Fellow at RSISE Marie Curie Outgoing International Fellowship * @article{alur2002, title={alternating-time Temporal Logic}, author={alur,
More informationDistributed games with causal memory are decidable for series-parallel systems
Distributed games with causal memory are decidable for series-parallel systems Paul Gastin, enjamin Lerman, Marc Zeitoun Firstname.Name@liafa.jussieu.fr LIF, Université Paris 7, UMR CNRS 7089 FSTTCS, dec.
More informationCDS 270 (Fall 09) - Lecture Notes for Assignment 8.
CDS 270 (Fall 09) - Lecture Notes for Assignment 8. ecause this part of the course has no slides or textbook, we will provide lecture supplements that include, hopefully, enough discussion to complete
More informationCS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics
CS256/Spring 2008 Lecture #11 Zohar Manna Beyond Temporal Logics Temporal logic expresses properties of infinite sequences of states, but there are interesting properties that cannot be expressed, e.g.,
More informationIntroduction to Embedded Systems
Introduction to Embedded Systems Sanjit A. Seshia UC Berkeley EECS 149/249A Fall 2015 2008-2015: E. A. Lee, A. L. Sangiovanni-Vincentelli, S. A. Seshia. All rights reserved. Chapter 13: Specification and
More informationSanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Explicit-State Model Checking: Additional Material Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: G. Holzmann Checking if M satisfies : Steps 1. Compute Buchi
More informationSymbolic Decentralized Supervisory Control
Symbolic Decentralized Supervisory Control SYMBOLIC DECENTRALIZED SUPERVISORY CONTROL BY URVASHI AGARWAL, B.Eng. a thesis submitted to the department of computing & software and the school of graduate
More informationGuest lecturer: Prof. Mark Reynolds, The University of Western Australia
Università degli studi di Udine Corso per il dottorato di ricerca: Temporal Logics: Satisfiability Checking, Model Checking, and Synthesis January 2017 Lecture 01, Part 02: Temporal Logics Guest lecturer:
More informationModel Checking: An Introduction
Model Checking: An Introduction Meeting 3, CSCI 5535, Spring 2013 Announcements Homework 0 ( Preliminaries ) out, due Friday Saturday This Week Dive into research motivating CSCI 5535 Next Week Begin foundations
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationRelational Interfaces and Refinement Calculus for Compositional System Reasoning
Relational Interfaces and Refinement Calculus for Compositional System Reasoning Viorel Preoteasa Joint work with Stavros Tripakis and Iulia Dragomir 1 Overview Motivation General refinement Relational
More informationIntegrating Induction and Deduction for Verification and Synthesis
Integrating Induction and Deduction for Verification and Synthesis Sanjit A. Seshia Associate Professor EECS Department UC Berkeley DATE 2013 Tutorial March 18, 2013 Bob s Vision: Exploit Synergies between
More informationAutomatic Synthesis of Distributed Protocols
Automatic Synthesis of Distributed Protocols Rajeev Alur Stavros Tripakis 1 Introduction Protocols for coordination among concurrent processes are an essential component of modern multiprocessor and distributed
More informationStrategy Logic. 1 Introduction. Krishnendu Chatterjee 1, Thomas A. Henzinger 1,2, and Nir Piterman 2
Strategy Logic Krishnendu Chatterjee 1, Thomas A. Henzinger 1,2, and Nir Piterman 2 1 University of California, Berkeley, USA 2 EPFL, Switzerland c krish@eecs.berkeley.edu, {tah,nir.piterman}@epfl.ch Abstract.
More informationExtension based Limited Lookahead Supervision of Discrete Event Systems
Extension based Limited Lookahead Supervision of Discrete Event Systems Ratnesh Kumar, Hok M. Cheung Department of Electrical Engineering University of Kentucky, Lexington, KY 40506 Steven I. Marcus Department
More informationPriority Scheduling of Distributed Systems Based on Model Checking
Priority Scheduling of Distributed Systems Based on Model Checking Ananda Basu 1, Saddek Bensalem 1, Doron Peled 2, and Joseph Sifakis 1 1 Centre Equation - VERIMAG, 2 Avenue de Vignate, Gieres, France
More informationTemporal Logic Model Checking
18 Feb, 2009 Thomas Wahl, Oxford University Temporal Logic Model Checking 1 Temporal Logic Model Checking Thomas Wahl Computing Laboratory, Oxford University 18 Feb, 2009 Thomas Wahl, Oxford University
More informationPSPACE-completeness of Modular Supervisory Control Problems
PSPACE-completeness of Modular Supervisory Control Problems Kurt Rohloff and Stéphane Lafortune Department of Electrical Engineering and Computer Science The University of Michigan 1301 Beal Ave., Ann
More informationSupervisor Localization of Discrete-Event. Systems with Infinite Behavior
Supervisor Localization of Discrete-Event 1 Systems with Infinite Behavior (October 25, 2017) Renyuan Zhang 1, Kai Cai 2 arxiv:1710.08751v1 [cs.sy] 24 Oct 2017 Abstract Recently we developed supervisor
More informationSupervisory Control of Manufacturing Systems with Time Specifications
Supervisory Control of Manufacturing Systems with Time Specifications Alexander Schaub Institute of Automatic Control Engineering Technische Universität München Joint Advanced Student School 2008 Bibliography
More informationEE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Discrete Event Simulation Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley)
More informationSynthesis of Asynchronous Systems
Synthesis of Asynchronous Systems Sven Schewe and Bernd Finkbeiner Universität des Saarlandes, 66123 Saarbrücken, Germany {schewe finkbeiner}@cs.uni-sb.de Abstract. This paper addresses the problem of
More informationReasoning about Strategies: From module checking to strategy logic
Reasoning about Strategies: From module checking to strategy logic based on joint works with Fabio Mogavero, Giuseppe Perelli, Luigi Sauro, and Moshe Y. Vardi Luxembourg September 23, 2013 Reasoning about
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationAn Introduction to Temporal Logics
An Introduction to Temporal Logics c 2001,2004 M. Lawford Outline Motivation: Dining Philosophers Safety, Liveness, Fairness & Justice Kripke structures, LTS, SELTS, and Paths Linear Temporal Logic Branching
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationSynthesis of Winning Strategies for Interaction under Partial Information
Synthesis of Winning Strategies for Interaction under Partial Information Oberseminar Informatik Bernd Puchala RWTH Aachen University June 10th, 2013 1 Introduction Interaction Strategy Synthesis 2 Main
More informationTowards Decentralized Synthesis: Decomposable Sublanguage and Joint Observability Problems
2014 American Control Conference (ACC) June 4-6, 2014. Portland, Oregon, USA Towards Decentralized Synthesis: Decomposable Sublanguage and Joint Observability Problems Liyong Lin, Alin Stefanescu, Rong
More informationThe MSO Theory of Connectedly Communicating Processes
The MSO Theory of Connectedly Communicating Processes P. Madhusudan 1, P. S. Thiagarajan 2, and Shaofa Yang 2 1 Dept. of Computer Science, University of Illinois at Urbana-Champaign Email: madhu@cs.uiuc.edu
More informationA Logic Primer. Stavros Tripakis University of California, Berkeley
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2015 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationLecture 9 Synthesis of Reactive Control Protocols
Lecture 9 Synthesis of Reactive Control Protocols Nok Wongpiromsarn Singapore-MIT Alliance for Research and Technology Richard M. Murray and Ufuk Topcu California Institute of Technology EECI, 16 May 2012
More informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationLecture 16: Computation Tree Logic (CTL)
Lecture 16: Computation Tree Logic (CTL) 1 Programme for the upcoming lectures Introducing CTL Basic Algorithms for CTL CTL and Fairness; computing strongly connected components Basic Decision Diagrams
More informationFinitary Winning in ω-regular Games
Finitary Winning in ω-regular Games Krishnendu Chatterjee 1 and Thomas A. Henzinger 1,2 1 University of California, Berkeley, USA 2 EPFL, Switzerland {c krish,tah}@eecs.berkeley.edu Abstract. Games on
More informationMinimising Deterministic Büchi Automata Precisely using SAT Solving
Minimising Deterministic Büchi Automata Precisely using SAT Solving Rüdiger Ehlers Saarland University, Reactive Systems Group SAT 2010 July 14, 2010 Rüdiger Ehlers (SB) DBA Minimization SAT 2010 July
More informationSymbolic Hierarchical Interface-based Supervisory Control
Symbolic Hierarchical Interface-based Supervisory Control Symbolic Synthesis and Verification of Hierarchical Interface-based Supervisory Control By Raoguang Song, B.Eng. A Thesis Submitted to the School
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
More informationComputer-Aided Program Design
Computer-Aided Program Design Spring 2015, Rice University Unit 3 Swarat Chaudhuri February 5, 2015 Temporal logic Propositional logic is a good language for describing properties of program states. However,
More informationLinear Temporal Logic and Büchi Automata
Linear Temporal Logic and Büchi Automata Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 Yih-Kuen Tsay (SVVRL @ IM.NTU) Linear Temporal Logic and Büchi Automata
More informationSupervisory control for collision avoidance in vehicular networks with imperfect measurements
Supervisory control for collision avoidance in vehicular networks with imperfect measurements The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story
More informationModel Checking. Temporal Logic. Fifth International Symposium in Programming, volume. of concurrent systems in CESAR. In Proceedings of the
Sérgio Campos, Edmund Why? Advantages: No proofs Fast Counter-examples No problem with partial specifications can easily express many concurrency properties Main Disadvantage: State Explosion Problem Too
More informationFrom Liveness to Promptness
From Liveness to Promptness Orna Kupferman Hebrew University Nir Piterman EPFL Moshe Y. Vardi Rice University Abstract Liveness temporal properties state that something good eventually happens, e.g., every
More informationIndustrial Automation (Automação de Processos Industriais)
Industrial Automation (Automação de Processos Industriais) Discrete Event Systems http://users.isr.ist.utl.pt/~jag/courses/api1516/api1516.html Slides 2010/2011 Prof. Paulo Jorge Oliveira Rev. 2011-2015
More informationDecentralized vs. Monolithic Control of Automata and Weighted Automata
Decentralized vs. Monolithic Control of Automata and Weighted Automata Jan Komenda INSTITUTE of MATHEMATICS Academy of Sciences Czech Republic Institute of Mathematics, Brno branch, November 11, 2016 Outline
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
More informationControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
Control Synthesis of Discrete Manufacturing Systems using Timed Finite utomata JROSLV FOGEL Institute of Informatics Slovak cademy of Sciences ratislav Dúbravská 9, SLOVK REPULIC bstract: - n application
More informationLecture 7 Synthesis of Reactive Control Protocols
Lecture 7 Synthesis of Reactive Control Protocols Richard M. Murray Nok Wongpiromsarn Ufuk Topcu California Institute of Technology AFRL, 25 April 2012 Outline Review: networked control systems and cooperative
More informationMOST OF the published research on control of discreteevent
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 1, JANUARY 1998 3 Discrete-Event Control of Nondeterministic Systems Michael Heymann and Feng Lin, Member, IEEE Abstract Nondeterminism in discrete-event
More informationExtending Supervisory Controller Synthesis to Deterministic Pushdown Automata Enforcing Controllability Least Restrictively
12th IFAC/IEEE Workshop on Discrete Event Systems Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata Enforcing Controllability Least Restrictively A.-K. Schmuck S. Schneider
More informationFormal Verification Techniques. Riccardo Sisto, Politecnico di Torino
Formal Verification Techniques Riccardo Sisto, Politecnico di Torino State exploration State Exploration and Theorem Proving Exhaustive exploration => result is certain (correctness or noncorrectness proof)
More informationCS256/Winter 2009 Lecture #1. Zohar Manna. Instructor: Zohar Manna Office hours: by appointment
CS256/Winter 2009 Lecture #1 Zohar Manna FORMAL METHODS FOR REACTIVE SYSTEMS Instructor: Zohar Manna Email: manna@cs.stanford.edu Office hours: by appointment TA: Boyu Wang Email: wangboyu@stanford.edu
More informationReactive Synthesis. Swen Jacobs VTSA 2013 Nancy, France u
Reactive Synthesis Nancy, France 24.09.2013 u www.iaik.tugraz.at 2 Property Synthesis (You Will Never Code Again) 3 Construct Correct Systems Automatically Don t do the same
More informationFault Tolerance, State Estimation and Fault Diagnosis in Petri Net Models
Fault Tolerance, State Estimation and Fault Diagnosis in Petri Net Models Christoforos Hadjicostis Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign March 27,
More informationMODULAR MULTITASKING SUPERVISORY CONTROL OF COMPOSITE DISCRETE-EVENT SYSTEMS. Max H. de Queiroz*, José E. R. Cury**
MODULAR MULTITASKING SUPERVISORY CONTROL OF COMPOSITE DISCRETE-EVENT SYSTEMS Max H. de Queiroz*, José E. R. Cury** * GEMM CEFET/SC Florianópolis SC 88020-301 Brazil maxqueiroz@cefetsc.edu.br ** LCMI DAS
More informationResilient Supervisory Control of Autonomous Intersections in the Presence of Sensor Attacks
Resilient Supervisory Control of Autonomous Intersections in the Presence of Sensor Attacks Amin Ghafouri and Xenofon D. Koutsoukos Abstract Cyber-physical systems (CPS), such as autonomous vehicles crossing
More informationOn simulations and bisimulations of general flow systems
On simulations and bisimulations of general flow systems Jen Davoren Department of Electrical & Electronic Engineering The University of Melbourne, AUSTRALIA and Paulo Tabuada Department of Electrical
More informationDecentralized Diagnosis of Discrete Event Systems using Unconditional and Conditional Decisions
Decentralized Diagnosis of Discrete Event Systems using Unconditional and Conditional Decisions Yin Wang, Tae-Sic Yoo, and Stéphane Lafortune Abstract The past decade has witnessed the development of a
More informationReducing the Supervisory Control of Discrete- Event Systems under Partial Observation
MODARES JOURNAL OF ELECTRICAL ENGINEERING, VOL 16, NO 4, WINTER 2016 29 Reducing the Supervisory Control of Discrete- Event Systems under Partial Observation Vahid Saeidi, Ali A. Afzalian, and Davood Gharavian
More informationWeak Alternating Automata and Tree Automata Emptiness
Weak Alternating Automata and Tree Automata Emptiness Orna Kupferman UC Berkeley Moshe Y. Vardi Rice University Abstract Automata on infinite words and trees are used for specification and verification
More informationDecentralized Modular Control of Concurrent Fuzzy Discrete Event Systems
2010 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 30-July 02, 2010 ThB07.2 Decentralized Modular Control of Concurrent Fuzzy Discrete Event Systems Awantha Jayasiri, George
More informationOverview. Discrete Event Systems Verification of Finite Automata. What can finite automata be used for? What can finite automata be used for?
Computer Engineering and Networks Overview Discrete Event Systems Verification of Finite Automata Lothar Thiele Introduction Binary Decision Diagrams Representation of Boolean Functions Comparing two circuits
More information