Control Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
|
|
- Camilla Carson
- 6 years ago
- Views:
Transcription
1 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 of timed game automaton to the control synthesis of discrete manufacturing systems is presented in the paper. This approach adopts the algorithm for optimal control synthesis of timed automata proposed in [] as a game-theoretic approach between controller the model of the plant. Key- Words: - Timed automat control synthesis, model verification, production systems.. Introduction t this time, there exist two main approaches to the control synthesis of timed discrete event dynamic systems. The first language - based approach is the extension of the basic Ramadge- Wonham supervisory control theory with time constraints can be found in [5]. In this approach the supervisory control is based on the theory of formal languages. The second approach is state - based. The authors of [,] use a game - theoretic formulation of the control synthesis problem. In this approach, the interaction between a controller the plant can be seen as some variant of the two- person antagonistic game. strategy for a given game is a rule that tells the controller how to choose between possible actions in any game position for finite state games is done using the max- min principle of [6]. The manufacturing systems are composed of the number of distributed production devices, which can be modeled by timed automata. The composite model of the production process can be obtained as the synchronous composition of the individual models. The behaviors of the composite model can be specified for example, by timed computational tree logic (TCTL) verified using some of the known model checking techniques. t this time, there exist several modeling verification tools also known as formal methods, which are available on the net. For timed automata these are for example, Kronos [3], Uppaal [4]. The availability of such powerful verification techniques enables to design the model with correct quantitative timing information before its using for the optimal controller strategy extraction. The rest of the paper is organized as follows: In section, we introduce the Timed game automaton describe the synthesis algorithm given in []. In section 3, the application of the proposed algorithm in the control of discrete manufacturing systems is described. The illustrative example is given in section 4.. Time optimal control strategy for timed game automaton The theory of timed automata was first described in [7]. Timed automata are finite automata equipped with time variables also called clocks. Clocks grow uniformly when the automaton is in some state. Clocks constraints may be state invariants or the transition guards that specify when the transition is enabled. Some clocks may be reset when the transition is taken. Time games between timed automata its environment are modeled by timed game automaton [,]. Timed game automaton (TG) is a tuple TG=(Z,,, T, T, δ, ρ) Z Q X is a zone, Q X are the state clock spaces,, are distinct action alphabets, are controller action are uncontrolled action of the environment, T Q X ε T Q X ε are timing constraints, ε, ε are {ε} {ε}, ε is an action, δ: Q ε ε Q ρ: Q ε ε J(X) are transition reset functions, J(X) determines the functions which resets the clocks. Further requirements given in [] are the following: the automaton is strongly non-zeno, the set T (a)={x: (a) T } is a k- zone similar T (. The winning game problem of a player (rachystochronic problem) is formulated as follows: Given a TG a set F Q X find a strategy T * T for player which allows him to reach the target set F as fast as possible whatever player does.
2 The algorithm computes the value function f * : Q X R + that allows to reach F from ( in no more than f * ( time. The algorithm assumes that in the configuration ( the value function f is known in each time or discrete step (defined in []). For those configurations from which it is not possible to reach F the function f has the value infinity. The algorithm is given in [] as follows: Initialization step when ( F f ( otherwise α act( < πidle( { ε} > πidle( α( α act( { ε} = πidle( < = πidle( = αact( = { a T max f ( δ' ( = πact( f ( )}. ε b The authors show that the algorithm converges if function f used in the algorithm belong to the class of k- simple functions, which is closed under operator π. k - simple functions are defined as Iteration steps repeat n:= n+ ; f n := π ( f n- ); until f n = f n- ; Strategy extraction is f * := f n ; T * = α (f * ) The operators are defined as follows: π ( f ) = min{ f, πact( f ), πidle( f ) } πact( = min max f ( δ '( ) π idle a ε b ( = inf v( t R+ v( = max(sup g( τ ), t + f ( x + ) τ < t g( max( τ + f ( δ '( x + τ, ε, )) = b The strategy extraction operator is given as () ( if a = b = ε, ( ε ) T δ '( ( δ (, ρ( ( ) otherwise ci when x Di f ( dj xlj when x Ej D i, i=,...,m E j, j=,...,n are k- zones, E j {x x lj k} c i, d j N { }. subset of X is called k-zone if it can be obtained as a oolean combination of inequalities of the form x i c, x i > c, x i - x j c, c {,,..., k}. 3. pplication of the algorithm in the production process control The discrete production process consists of the group of distributed production devices co-operating mutually. Every device can be modeled as TG. The complex model of the production process can be defined as the synchronous parallel composition of the individual TG i as follows. Let TG = (Z,,, T, T, σ, ρ ) TG = (Z,,, T, T, σ, ρ ) then the parallel composition is defined as TG TG =(Z,,, T, T, σ, ρ), Q = Q Q, X =X X, Z=Q X, =, =, T T T T T T T T when a when a when a when b when b when b
3 { q', s' q' Q, s' Q} if a or b δ ( = q', δ ( s, = s' δ ( s, { q', s q' Q, s Q} if a or b δ ( = q' { s' q Q, s' Q} if a or b δ ( s, = s' The parallel operator can be easily spread to n devices. In this application, the action from can be interpreted as the control actions that start the technological operations, meantime the actions from are reaction of the environment as e.g., information about the operation finishing, some sensor or break-down information, etc., obtained by the monitoring subsystem. During the model development process, it is necessary to create the correct model expressing all technological requirements as e.g., timing constraints, sequences of technological operations, model safety, etc. The model, which satisfies these requirements, can be obtained in the verification process also known as model checking for finite state models. s we mentioned before, there exist several programming tools using the description language based on the timed automata model. The specification language of the model behaviors usually used is based on the real-time temporal logic as e.g., TCTL (time computational tree logic). Such modeling verification tools are already mentioned Kronos Uppaal. Using these tools those state transitions can be found by reachability analysis from which the model cannot reach the target set. For these states, the values of the function f have to be set equal infinity for every transition. 4. n illustrative example The working cell contains two numerically controlled machines M M. Each machine may process two types of parts P P. The parts enter the incoming buffer with regard to part's type in alternating way. The capacity of the buffer is one. The buffer is getting free when a part begins to be processing on some machine that is simultaneously the signal for the entrance of a new part into the buffer. The machines can process both types of parts with the different periods of processing d ij, i=,; j=,, i is the type of the machine j is the type of the part. fter the operations on the machines are finished, the parts enter the outgoing buffer if this is free. The capacity of the outgoing buffer is also one. We suppose that the buffer will be made automatically until time T. The goal is to find the control strategy starting the operations of the parts processing on the machines such, that the parts' frequency entrance into the incoming buffer is maximal. The following constraints must be fulfilled in each production cycle. t the same time, each machine can process only one part. Fig.. Timed automata model of M
4 Fig.. Timed automata model of M The signal about the operation finishing on a given machine arrives after the period d ij has elapsed. The models of machines M, M incoming outgoing buffers UF in, UF out are shown in Figures - 3 in the form of timed finite automata. Here start ij is the control action machine Mi starts work on a Pj- part while finish ij is the uncontrolled action machine Mi finishes working on a Pj-part. is the uncontrolled event signalling that the outgoing buffer is free, P j is the event signalling which type of part is in the incoming buffer. The meaning of the automaton states is evident from their names. The initial states are marked by small arrow. In the wait state, the machine is waiting for the signal maximally T time units. The time constants have the following meaning: T, T are upper - bound time constants during which it is advantageous for the machine (from the point of view of the production cycle minimisation) to wait for the part of the other type then to perform the operation on the part actually being situated in the buffer. These constant can be determined from the technological parameters d ij T. Where T is upper- bound time constant during which the outgoing buffer is getting free. T is the waiting time of the part in the buffer for processing on the machine. The objective of the control strategy is to minimize the total sum of T for a given time horizon. ccording the operation processing on machine Mi, the strategy for machine Mj, j i is determined as follows: Mj is waiting for the part of other type in the idle state or Mj is performing the operation on the part actually placed in the incoming buffer. The level of the part processing on machine Mi is given by the value d ij - y y is the actual value of the time variable during the model's visit in the busy state. The optimal waiting time t of the machine is time that gives the infimum of the function v( in the relation (). The complex model of the production cell is given as the parallel composition of the individual devices M M UF in UF out. The value functions f for the state transitions of the machines M M are shown in Tables. For buffers' transitions their values are equal. The described algorithm can provide the following decisions. For example, let the model is in the configuration (busy, idle, full, ) in time given by the local time variables (y [d -λ, d ], z=, u [,T], x=), λ [d, ] is the level of the part P processing on machine M. Let the part P is in the incoming buffer d <d d <d. In the case, when λ is sufficiently small it is advantageous for M to wait in the state idle for part of the type than to process part P actually placed in the buffer. The results of the algorithm follow. The results of the algorithm for the control strategy extraction (case ) were obtained in the simulation process. For the given technological values d ij T, the objective function Q = T was computed for time horizon of parts then compared with fixed strategy (case, each part is processed on that machine which processing time is shorter). The signal was generated romly with the uniform distribution function from the interval [,T ] T was equal 5 time units. The values of the processing intervals were d =, d = 4, d = 5, d = 5 time units. The function Q computed in case has the value Q = 847 which is smaller than the value Q = 9 computed in case.
5 5. Conclusion The described method of the production modelling control has the following advantages: it enables to use the existing modelling tools for the model development its verification from the point of view of the control synthesis it renders time-optimal trajectory for reaching the target configuration of the model. Table. states y actions idle start j (, T ] ε busy (,d ) ε [d, ) busy (,d ) ε [d, ) wait d (d, d +T ] ε (d, d +T ] wait d (d, d +T ] ε (d, d +T ] Table. states z actions idle start j (, T ] ε busy (,d ) ε [d, ) busy (,d ) ε [d, ) wait d (d, d +T ] ε (d, d +T ] wait d (d, d +T ] ε (d, d +T ] actions finish finish action s finish finish f T - y d - y d d - y d d + T -y T d + T -y T f T - z d - z d d - z d d + T -z T d + T -z T References: [] E. sarin, O. Maler, s Soon as Possible: Time Optimal Control for Timed utomata. In: Hybrid Systems: Computation Control, LNCS 569, Springer 999, pp [] E. sarin, O. Maler,. Pnueli, J. Sifakis, Controller Synthesis for Timed utomata. In: Proc. IFC Symposium on Structure Control, Elsevier 998, pp [3] S. Yovine, Kronos: Verification Tool for Real- Time Systems. In: Int. Journal on Software Tools for Technology Transfer, Vol.. No. /, October 997. [4] K. Larsen, P. Pettersson, Wang Yi, Uppaal in a Nutshell. In: Int. Journal on Software Tools for Technology Transfer, Vol.. No. /, October 997, pp [5].. rin W.M. Wonham, The Supervisory Control of Timed DES, IEEE Transactions on utomatic Control, Vol.39, No., 994, pp [6] J. von Neumann O. Morgenstern, Theory of Games Economic ehavior, Princ. University Press, 944. [7] R. lur D. L. Dill, Theory of Timed utomat Theoretical Computer Science 6, 994,pp Fig. 3. Timed automata model of UF out UF in
Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods
Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods Sanjit A. Seshia and Randal E. Bryant Computer Science Department Carnegie Mellon University Verifying Timed Embedded Systems
More informationApproximately Bisimilar Finite Abstractions of Stable Linear Systems
Approximately Bisimilar Finite Abstractions of Stable Linear Systems Antoine Girard Université Joseph Fourier Laboratoire de Modélisation et Calcul B.P. 53, 38041 Grenoble, France Antoine.Girard@imag.fr
More information(a1 b 1 ) (a 1 b 2 ) (a 2 b 1 ) Fig. 1. A simple game. (a2 b 2 ) Trivial as it might seem, this is the essence of any synthesis algorithm, a
CONTROLLER SYNTHESIS FOR TIMED AUTOMATA 1 Eugene Asarin Oded Maler Amir Pnueli Joseph Sifakis Institute for Information Transmission Problems, 19 Bol. Karetnyi per. 101447 Moscow, Russia. asarin@ippi.ras.ru
More informationReachability-Time Games on Timed Automata (Extended Abstract)
Reachability-Time Games on Timed Automata (Extended Abstract) Marcin Jurdziński and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK Abstract. In a reachability-time game, players
More informationModels for Efficient Timed Verification
Models for Efficient Timed Verification François Laroussinie LSV / ENS de Cachan CNRS UMR 8643 Monterey Workshop - Composition of embedded systems Model checking System Properties Formalizing step? ϕ Model
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 informationDiagnosis of Dense-Time Systems using Digital-Clocks
Diagnosis of Dense-Time Systems using Digital-Clocks Shengbing Jiang GM R&D and Planning Mail Code 480-106-390 Warren, MI 48090-9055 Email: shengbing.jiang@gm.com Ratnesh Kumar Dept. of Elec. & Comp. Eng.
More informationReal-Time Systems. Lecture 15: The Universality Problem for TBA Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany
Real-Time Systems Lecture 15: The Universality Problem for TBA 2013-06-26 15 2013-06-26 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: Extended Timed
More informationFormally Correct Monitors for Hybrid Automata. Verimag Research Report n o TR
Formally Correct Monitors for Hybrid Automata Goran Frehse, Nikolaos Kekatos, Dejan Nickovic Verimag Research Report n o TR-2017-5 September 20, 2017 Verimag, University of Grenoble Alpes, Grenoble, France.
More informationController Synthesis with UPPAAL-TIGA. Alexandre David Kim G. Larsen, Didier Lime, Franck Cassez, Jean-François Raskin
Controller Synthesis with UPPAAL-TIGA Alexandre David Kim G. Larsen, Didier Lime, Franck Cassez, Jean-François Raskin Overview Timed Games. Algorithm (CONCUR 05). Strategies. Code generation. Architecture
More informationRobust Reachability in Timed Automata: A Game-based Approach
Robust Reachability in Timed Automata: A Game-based Approach Patricia Bouyer, Nicolas Markey, and Ocan Sankur LSV, CNRS & ENS Cachan, France. {bouyer,markey,sankur}@lsv.ens-cachan.fr Abstract. Reachability
More informationAutomata-theoretic analysis of hybrid systems
Automata-theoretic analysis of hybrid systems Madhavan Mukund SPIC Mathematical Institute 92, G N Chetty Road Chennai 600 017, India Email: madhavan@smi.ernet.in URL: http://www.smi.ernet.in/~madhavan
More informationModelling Real-Time Systems. Henrik Ejersbo Jensen Aalborg University
Modelling Real-Time Systems Henrik Ejersbo Jensen Aalborg University Hybrid & Real Time Systems Control Theory Plant Continuous sensors actuators Task TaskTask Controller Program Discrete Computer Science
More informationTimed Automata VINO 2011
Timed Automata VINO 2011 VeriDis Group - LORIA July 18, 2011 Content 1 Introduction 2 Timed Automata 3 Networks of timed automata Motivation Formalism for modeling and verification of real-time systems.
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 informationAn Introduction to Hybrid Systems Modeling
CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical
More informationAnalysis and Optimization of Discrete Event Systems using Petri Nets
Volume 113 No. 11 2017, 1 10 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Analysis and Optimization of Discrete Event Systems using Petri Nets
More informationTowards the Complexity of Controls for Timed Automata with a Small Number of Clocks
Fifth International Conference on Fuzzy Systems and Knowledge Discovery Towards the Complexity of Controls for Timed Automata with a Small Number of Clocks Taolue Chen CWI PO Box 94079, 1090 GB Amsterdam,
More informationAn introduction to Uppaal and Timed Automata MVP5 1
An introduction to Uppaal and Timed Automata MVP5 1 What is Uppaal? (http://www.uppaal.com/) A simple graphical interface for drawing extended finite state machines (automatons + shared variables A graphical
More informationJob-Shop Scheduling Using Timed Automata
Job-Shop Scheduling Using Timed Automata Yasmina Abdeddaïm and Oded Maler Verimag, CentreEquation 2, av. de Vignate 3861 Gières, France {Yasmina.Abdeddaim,Oded.Maler}@imag.fr Abstract. In this paper we
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 informationAs Soon As Probable. O. Maler, J.-F. Kempf, M. Bozga. March 15, VERIMAG Grenoble, France
As Soon As Probable O. Maler, J.-F. Kempf, M. Bozga VERIMAG Grenoble, France March 15, 2013 O. Maler, J.-F. Kempf, M. Bozga (VERIMAG Grenoble, France) As Soon As Probable March 15, 2013 1 / 42 Executive
More informationAPPROXIMATE SIMULATION RELATIONS FOR HYBRID SYSTEMS 1. Antoine Girard A. Agung Julius George J. Pappas
APPROXIMATE SIMULATION RELATIONS FOR HYBRID SYSTEMS 1 Antoine Girard A. Agung Julius George J. Pappas Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia, PA 1914 {agirard,agung,pappasg}@seas.upenn.edu
More informationTimed Control with Observation Based and Stuttering Invariant Strategies
Author manuscript, published in "5th Int. Symp. on Automated Technology for Verification and Analysis (ATVA'07) 4762 (2007) 307--321" Timed Control with Observation Based and Stuttering Invariant Strategies
More informationfor System Modeling, Analysis, and Optimization
Fundamental Algorithms for System Modeling, Analysis, and Optimization Stavros Tripakis UC Berkeley EECS 144/244 Fall 2013 Copyright 2013, E. A. Lee, J. Roydhowdhury, S. A. Seshia, S. Tripakis All rights
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 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 informationHybrid systems and computer science a short tutorial
Hybrid systems and computer science a short tutorial Eugene Asarin Université Paris 7 - LIAFA SFM 04 - RT, Bertinoro p. 1/4 Introductory equations Hybrid Systems = Discrete+Continuous SFM 04 - RT, Bertinoro
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 information7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing-
7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing- Constrained Systems, Proc. 4th Workshop Computer-Aided Verication, Lecture Notes in Computer Science 663, Springer-Verlag,
More informationController Synthesis for MTL Specifications
Controller Synthesis for MTL Specifications Patricia Bouyer, Laura Bozzelli, and Fabrice Chevalier LSV, CNRS & ENS Cachan, France {bouyer,bozzelli,chevalie}@lsv.ens-cachan.fr Abstract. We consider the
More informationPartial Order Reductions for Timed Systems
Partial Order Reductions for Timed Systems Johan Bengtsson 1 Bengt Jonsson 1 Johan Lilius 2 Wang Yi 1 1 Department of Computer Systems, Uppsala University, Sweden. Email: {bengt,johanb,yi}@docs.uu.se 2
More informationThe Verification of Real Time Systems using the TINA Tool
Proceedings of the 17th World Congress The International Federation of Automatic Control The Verification of Real Time Systems using the TINA Tool Pedro M. Gonzalez del Foyo Jose Reinaldo Silva Dept. Of
More informationBridging the Gap between Reactive Synthesis and Supervisory Control
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)
More informationmodels, languages, dynamics Eugene Asarin PIMS/EQINOCS Workshop on Automata Theory and Symbolic Dynamics LIAFA - University Paris Diderot and CNRS
models, s, LIAFA - University Paris Diderot and CNRS PIMS/EQINOCS Workshop on Automata Theory and Symbolic Dynamics Context A model for verification of real-time systems Invented by Alur and Dill in early
More informationTIMED automata, introduced by Alur and Dill in [3], have
1 Language Inclusion Checking of Timed Automata with Non-Zenoness Xinyu Wang, Jun Sun, Ting Wang, and Shengchao Qin Abstract Given a timed automaton P modeling an implementation and a timed automaton S
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 informationMODEL CHECKING TIMED SAFETY INSTRUMENTED SYSTEMS
TKK Reports in Information and Computer Science Espoo 2008 TKK-ICS-R3 MODEL CHECKING TIMED SAFETY INSTRUMENTED SYSTEMS Jussi Lahtinen ABTEKNILLINEN KORKEAKOULU TEKNISKA HÖGSKOLAN HELSINKI UNIVERSITY OF
More informationThe Element of Surprise in Timed Games
In Proc. of CONCUR 2003: 14th International Conference on Concurrency Theory, Lectures Notes in Computer Science, Springer-Verlag, 2003. The Element of Surprise in Timed Games Luca de Alfaro 1, Marco Faella
More informationVerification of temporal properties on hybrid automata by simulation relations
Proceedings of the 46th IEEE Conference on Decision and Control New Orleans, LA, USA, Dec. 2-4, 2007 Verification of temporal properties on hybrid automata by simulation relations A. D Innocenzo, A.A.
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 informationarxiv: v2 [cs.sy] 16 Jun 2011
CONTROLLER SYNTHESIS FOR SAFETY AND REACHABILITY VIA APPROXIMATE BISIMULATION ANTOINE GIRARD arxiv:1010.4672v2 [cs.sy] 16 Jun 2011 Abstract. In this paper, we consider the problem of controller design
More informationThe algorithmic analysis of hybrid system
The algorithmic analysis of hybrid system Authors: R.Alur, C. Courcoubetis etc. Course teacher: Prof. Ugo Buy Xin Li, Huiyong Xiao Nov. 13, 2002 Summary What s a hybrid system? Definition of Hybrid Automaton
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 informationState Explosion in Almost-Sure Probabilistic Reachability
State Explosion in Almost-Sure Probabilistic Reachability François Laroussinie Lab. Spécification & Vérification, ENS de Cachan & CNRS UMR 8643, 61, av. Pdt. Wilson, 94235 Cachan Cedex France Jeremy Sproston
More informationSupervisory Control of Hybrid Systems
X.D. Koutsoukos, P.J. Antsaklis, J.A. Stiver and M.D. Lemmon, "Supervisory Control of Hybrid Systems, in Special Issue on Hybrid Systems: Theory and Applications, Proceedings of the IEEE, P.J. Antsaklis,
More informationAnalysis of a Boost Converter Circuit Using Linear Hybrid Automata
Analysis of a Boost Converter Circuit Using Linear Hybrid Automata Ulrich Kühne LSV ENS de Cachan, 94235 Cachan Cedex, France, kuehne@lsv.ens-cachan.fr 1 Introduction Boost converter circuits are an important
More informationVerification and Performance Evaluation of Timed Game Strategies
Verification and Performance Evaluation of Timed Game Strategies Alexandre David 1, Huixing Fang 2, Kim G. Larsen 1, and Zhengkui Zhang 1 1 Department of Computer Science, Aalborg University, Denmark {adavid,kgl,zhzhang}@cs.aau.dk
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 informationExperiments in the use of tau-simulations for the components-verification of real-time systems
Experiments in the use of tau-simulations for the components-verification of real-time systems Françoise Bellegarde, Jacques Julliand, Hassan Mountassir, Emilie Oudot To cite this version: Françoise Bellegarde,
More informationSymmetry Reduction and Compositional Verification of Timed Automata
Symmetry Reduction and Compositional Verification of Timed Automata Hoang Linh Nguyen University of Waterloo Waterloo, Canada Email: nhoangli@uwaterloo.ca Richard Trefler University of Waterloo Waterloo,
More informationAutomata Theory (2A) Young Won Lim 5/31/18
Automata Theory (2A) Copyright (c) 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationHybrid Control and Switched Systems. Lecture #1 Hybrid systems are everywhere: Examples
Hybrid Control and Switched Systems Lecture #1 Hybrid systems are everywhere: Examples João P. Hespanha University of California at Santa Barbara Summary Examples of hybrid systems 1. Bouncing ball 2.
More informationVerification of Linear Duration Invariants by Model Checking CTL Properties
UNU-IIST International Institute for Software Technology Verification of Linear Duration Invariants by Model Checking CTL Properties Miaomiao Zhang, Dang Van Hung and Zhiming Liu June 2008 UNU-IIST Report
More informationSerge Haddad Mathieu Sassolas. Verification on Interrupt Timed Automata. Research Report LSV-09-16
Béatrice Bérard Serge Haddad Mathieu Sassolas Verification on Interrupt Timed Automata Research Report LSV-09-16 July 2009 Verification on Interrupt Timed Automata Béatrice Bérard 1, Serge Haddad 2, Mathieu
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 informationTopics in Timed Automata
1/32 Topics in Timed Automata B. Srivathsan RWTH-Aachen Software modeling and Verification group 2/32 Timed Automata A theory of timed automata R. Alur and D. Dill, TCS 94 2/32 Timed Automata Language
More informationAutomated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol
Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol Béatrice Bérard and Laurent Fribourg LSV Ecole Normale Supérieure de Cachan & CNRS 61 av. Pdt. Wilson - 94235 Cachan
More informationSynthesis from Probabilistic Components
Synthesis from Probabilistic Components Yoad Lustig, Sumit Nain, and Moshe Y. Vardi Department of Computer Science Rice University, Houston, TX 77005, USA yoad.lustig@gmail.com, nain@cs.rice.edu, vardi@cs.rice.edu
More informationSafety Verification of Fault Tolerant Goal-based Control Programs with Estimation Uncertainty
2008 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June 11-13, 2008 WeAI01.6 Safety Verification of Fault Tolerant Goal-based Control Programs with Estimation Uncertainty Julia
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 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 informationDISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES
DISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES Maxim Gromov 1, Khaled El-Fakih 2, Natalia Shabaldina 1, Nina Yevtushenko 1 1 Tomsk State University, 36 Lenin Str.. Tomsk, 634050, Russia gromov@sibmail.com,
More informationMeasuring Permissivity in Finite Games
Measuring Permissivity in Finite Games Patricia Bouyer, Marie Duflot, Nicolas Markey, and Gabriel Renault 3 LSV, CNRS & ENS Cachan, France {bouyer,markey}@lsv.ens-cachan.fr LACL, Université Paris, France
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationTimed Control with Partial Observability
Timed Control with Partial Observability Patricia Bouyer 1, Deepak D Souza 2, P. Madhusudan 3, and Antoine Petit 1 1 LSV CNRS UMR 8643 & ENS de Cachan, 61, av. du Prés. Wilson, 94230 Cachan, France 2 Chennai
More informationAutomata-based Verification - III
CS3172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20/22: email: howard.barringer@manchester.ac.uk March 2005 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationUPPAAL tutorial What s inside UPPAAL The UPPAAL input languages
UPPAAL tutorial What s inside UPPAAL The UPPAAL inut languages 1 UPPAAL tool Develoed jointly by Usala & Aalborg University >>8,000 downloads since 1999 1 UPPAAL Tool Simulation Modeling Verification 3
More informationLecture 11: Timed Automata
Real-Time Systems Lecture 11: Timed Automata 2014-07-01 11 2014-07-01 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: DC (un)decidability This Lecture:
More informationReal-Time Systems. Lecture 10: Timed Automata Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany main
Real-Time Systems Lecture 10: Timed Automata 2013-06-04 10 2013-06-04 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: PLC, PLC automata This Lecture:
More informationOn decision problems for timed automata
On decision problems for timed automata Olivier Finkel Equipe de Logique Mathématique, U.F.R. de Mathématiques, Université Paris 7 2 Place Jussieu 75251 Paris cedex 05, France. finkel@logique.jussieu.fr
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 informationRandomness for Free. 1 Introduction. Krishnendu Chatterjee 1, Laurent Doyen 2, Hugo Gimbert 3, and Thomas A. Henzinger 1
Randomness for Free Krishnendu Chatterjee 1, Laurent Doyen 2, Hugo Gimbert 3, and Thomas A. Henzinger 1 1 IST Austria (Institute of Science and Technology Austria) 2 LSV, ENS Cachan & CNRS, France 3 LaBri
More informationEfficient algorithms and tools for MITL model-checking and synthesis
Efficient algorithms and tools for MITL model-checking and synthesis Thomas Brihaye UMons Mons, Belgium thomas.brihaye@umons.be Arthur Milchior Université libre de Bruxelles Bruxelles, Belgique arthur.milchior@ulb.ac.be
More informationBisimilar Finite Abstractions of Interconnected Systems
Bisimilar Finite Abstractions of Interconnected Systems Yuichi Tazaki and Jun-ichi Imura Tokyo Institute of Technology, Ōokayama 2-12-1, Meguro, Tokyo, Japan {tazaki,imura}@cyb.mei.titech.ac.jp http://www.cyb.mei.titech.ac.jp
More informationTimed Discrete Event Control of Parallel Production Lines with Continuous Outputs
Discrete Event Dyn Syst (2008) 18:241 262 DOI 10.1007/s10626-007-0023-2 Timed Discrete Event Control of Parallel Production Lines with Continuous Outputs Stephanie Geist Dmitry Gromov Jörg Raisch Received:
More informationSynthesizing Switching Logic using Constraint Solving
Synthesizing Switching Logic using Constraint Solving Ankur Taly 1, Sumit Gulwani 2, and Ashish Tiwari 3 1 Computer Science Dept., Stanford University ataly@stanford.edu 2 Microsoft Research, Redmond,
More informationAutomata-theoretic Decision of Timed Games
Automata-theoretic Decision of Timed Games Marco Faella a, Salvatore La Torre b, Aniello Murano a a Università degli Studi di Napoli Federico II, 80126 Napoli {faella, murano}@na.infn.it b Università degli
More informationlarge systems, and this might lead in the future to better algorithms for certain classes of scheduling problems. Even if they do not contribute to im
Job-Shop Scheduling using Timed Automata Yasmina Abdeddam and Oded Maler Verimag, Centre Equation, 2, av. de Vignate 3861 Gieres, France Yasmina.Abdeddaim@imag.fr Oded.Maler@imag.fr Abstract. In this paper
More informationPolynomial Interrupt Timed Automata
Polynomial Interrupt Timed Automata Béatrice Bérard 1,4, Serge Haddad 2,4,5, Claudine Picaronny 2,4,5, Mohab Safey El Din 1,4,5, and Mathieu Sassolas 3 1 Sorbonne Université, Université P. & M. Curie,
More informationHourglass Automata. Yuki Osada, Tim French, Mark Reynolds, and Harry Smallbone
Hourglass Automata Yuki Osada, Tim French, Mark Reynolds, and Harry Smallbone The University of Western Australia. yuki.osada@research.uwa.edu.au, {tim.french,mark.reynolds}@uwa.edu.au, 21306592@student.uwa.edu.au
More informationTimed Automata: Semantics, Algorithms and Tools
Timed Automata: Semantics, Algorithms and Tools Johan Bengtsson and Wang Yi Uppsala University {johanb,yi}@it.uu.se Abstract. This chapter is to provide a tutorial and pointers to results and related work
More informationSub-Optimal Scheduling of a Flexible Batch Manufacturing System using an Integer Programming Solution
Sub-Optimal Scheduling of a Flexible Batch Manufacturing System using an Integer Programming Solution W. Weyerman, D. West, S. Warnick Information Dynamics and Intelligent Systems Group Department of Computer
More informationEE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories. Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo
EE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories 1 Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo Outline: Contracts and compositional methods for system design Where and why using
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 informationFeng Lin. Abstract. Inspired by thewell-known motto of Henry David Thoreau [1], that government
That Supervisor Is Best Which Supervises Least Feng Lin Department of Electrical and Computer Engineering Wayne State University, Detroit, MI 48202 Abstract Inspired by thewell-known motto of Henry David
More informationA Decidable Class of Planar Linear Hybrid Systems
A Decidable Class of Planar Linear Hybrid Systems Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh Viswanathan, and Geir E. Dullerud University of Illinois at Urbana-Champaign. Abstract. The paper shows
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 9 Verification and Validation of Simulation Models Purpose & Overview The goal of the validation process is: To produce a model that represents true
More informationFormal Semantics for Grafcet Controlled Systems 1 Introduction 2 Grafcet
Formal Semantics for Grafcet Controlled Systems JANAN ZAYTOON Laboratoire d'automatique et de Microélectronique Faculté des Sciences Moulin de la Housse, BP 1039, 51687 Reims cedex 2 FRANCE Abstract: Grafcet
More informationRobustness and Implementability of Timed Automata
Robustness and Implementability of Timed Automata Martin De Wulf, Laurent Doyen, Nicolas Markey, and Jean-François Raskin Computer Science Departement, Université Libre de Bruxelles, Belgium Abstract.
More informationCOMPILING REAL-TIME SCENARIOS INTO A TIMED AUTOMATON*
COMPILING REAL-TIME SCENARIOS INTO A TIMED AUTOMATON* Aziz Salah, Rachida Dssouli, Guy Lapalme Département d Informatique et de Recherche Opérationnelle, Université de Montréal, H3T 1J4 Montreal, PQ, Canada
More informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationSymbolic Control of Incrementally Stable Systems
Symbolic Control of Incrementally Stable Systems Antoine Girard Laboratoire Jean Kuntzmann, Université Joseph Fourier Grenoble, France Workshop on Formal Verification of Embedded Control Systems LCCC,
More informationModel Checking Linear Duration Invariants of Networks of Automata
Model Checking Linear Duration Invariants of Networks of Automata Miaomiao Zhang 1, Zhiming Liu 2, and Naijun Zhan 3 1 School of Software Engineering, Tongji University, Shanghai, China miaomiao@tongji.edu.cn
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 informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationFormal Definition of Computation. August 28, 2013
August 28, 2013 Computation model The model of computation considered so far is the work performed by a finite automaton Finite automata were described informally, using state diagrams, and formally, as
More informationarxiv: v1 [cs.fl] 25 Nov 2018
Real-Time Systems Modeling and Analysis Lakhan Shiva Kamireddy [0000 0001 6007 5408] University of Colorado, Boulder CO 80302, USA {lakhan.kamireddy}@colorado.edu arxiv:1811.10083v1 [cs.fl] 25 Nov 2018
More informationA Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control
A Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control Massimo Benerecetti, University of Naples Federico II, Italy Marco Faella, University of Naples Federico II,
More informationProbabilistic Model Checking of Security Protocols without Perfect Cryptography Assumption
Our Model Checking of Security Protocols without Perfect Cryptography Assumption Czestochowa University of Technology Cardinal Stefan Wyszynski University CN2016 Our 1 2 3 Our 4 5 6 7 Importance of Security
More information