Timed Automata. Chapter Clocks and clock constraints Clock variables and clock constraints
|
|
- Pearl Berry
- 5 years ago
- Views:
Transcription
1 Chapter 10 Timed Automata In the previous chapter, we have discussed a temporal logic where time was a discrete entities. A time unit was one application of the transition relation of an LTS. We could express statements like the elevator never moves with opened doors or that the elevator eventually serves floor 5. In LTL, we cannot express the property that the elevator shall server floor 5 within 5 minutes. For many systems, their correctness not only depend on the results but also on when these results are produced. We call such systems Real-Time Systems. The Theory of Timed Automata has been developed to reason about such real-time systems. Note that this chapter introduces definitions. Examples can be found in the slides presented during the lectures Clocks and clock constraints Clock variables and clock constraints The main feature of the theory of Timed Automata is to introduce the notion of a clock. A clock is a real-valued variable. This means that in the context of Timed Automata, time is represented by a dense set. Time is a continuous entity. The intuition behind clocks is that all clocks in a system increase at the same rate. The only operations possible on a clock are (1) read the value of the clock and (2) reset the clock to 0. Intuitively, a clock represents the amount of time elapsed since the last reset of the clock (see Figure 10.1) Formally, a clock c simply is a non-negative real number, that is, c 2 R +. To express conditions over clocks, clock constraints are used. A clock constraint can be used in a location. In that case, it is called a location invariant. The intuition is that time is allowed to progress in the location as long as the invariant holds. When the invariant does not hold, the location must be left. When a clock constraint is used on a transition, it is called a guard. The intuition is that a transition is available as long as the guard holds. When the guard evaluates to false, the transition cannot be taken. We first define the set of valid clock constraints. Later we will come back to the semantics 67
2 68 CHAPTER 10. TIMED AUTOMATA Figure 10.1: A clock that is regularly reset. of invariants and guards. Definition (Clock constraints) A clock constraint over set C of clocks is formed according to the grammar: g ::= x<c x apple c x>c x c g ^ g where c 2 N. Let B(C) denote the set of clock constraints over C. Notes: 1. Clock constraints are often written in abbreviated form. For instance, consider a clock x, the constraint x apple 5 ^ x 3 will be written 3 apple x apple 5. The same holds for equality. Instead of writing x apple 5 ^ x 5, we shall write x == It is possible to also specify the difference between clocks at the price of a slightly more complex theory. In this chapter we will only treat the simpler theory. Clock constraints with clock differences have the form x y op c where op 2{<, apple,>, } and c 2 N. 3. The restriction to natural numbers is to ensure decidability of the reachability problem, that is, deciding whether a state is reachable. This decidability is not affected if we allow the rationals. It is possible to convert each rational in a clock constraint to a natural number by suitable scaling. In general, we can multiply each constant by the least common multiple of denominators of all constants appearing in all clock constraints Semantics for clock constraints In the previous sub-section, we define the syntax for clock constraints. In this subsection, we define their semantics, that is, when is a clock constraint true. Two concepts are needed for this:
3 10.2. TIMED AUTOMATA a clock valuation that will give the value of each clock; and 2. a satisfaction relation that will define for which valuation a given clock constraint is true. We first define a clock valuation: Definition (Clock valuation) A clock valution for a set of clock variables C is a function : C!IR + that assigns to each clock x 2Cits current value (x). We shall define the set of all possible valuations over a set of clocks C by Eval(C). We can now define the satisfaction relation for clock constraints. Definition (Satisfaction relation for clock constraints) Given a set of clocks C, a clock x 2C, a clock valuation 2 Eval(C), a natural number c 2 IN and clocks guards, 0 2B(C), the satisfaction relation for clock constraints = Eval(C) B(C) is defined as follows: = x<c iff (x) <c = x apple c iff (x) apple c = iff 6 = = ^ 0 iff = and = 0 To represent the update of clocks, we shall write + d that represents the clock valuation where all clocks have increased by some non-negative real number d. That is, ( + d)(x) = (x)+d for all clocks x 2C. When all clocks are equal to a constant value C, we shall write C to denote the clock valuation (x) =C for all clocks in C. Example For clock valuation =[x = 2,y = 22], valuation =[x = ,y = ] Timed Automata Definition Definition (Timed Automaton) A timed automaton is a tuple: TA =(Loc, Loc 0, Act, C,!, Inv, AP, L) where: 1. Loc is a finite set of locations; 2. Loc 0 is a finite set of initial locations; 3. Act is a finite set of actions; 4. C is a finite set of clocks; 5.! Loc Act B(C) 2 C Loc is a transition relation;
4 70 CHAPTER 10. TIMED AUTOMATA 6. inv : Loc!B(C) is an invariant assignment function; 7. AP is a finite set of atomic propositions; 8. L : Loc! 2 AP is a labelling function for the locations. B(TA) denote the set of clock constraints occurring in guards and invariants of TA.,, Regarding transitions, we shall write l! l 0 for (l,,,, l 0 ) 2!, where is an action in Act, is a clock guard in B(C), and Cis a set of clocks to be reset to Timed LTS semantics The semantics of a Timed Automaton is given by a Timed Transition System, which is a Labelled Transition Systems where actions are extended with delays. Definition (Transition systems semantics for a timed automaton) Given a timed automaton TA =(Loc, Loc 0, Act, C,!, Inv, AP, L), the transition system TS(TA)= (S, Act 0,! 0,I,AP 0,L 0 ) is defined as follows: S=Loc Eval(C) Act 0 = Act [ IR + I = {(l 0, ) l 0 2 Loc 0 ^8x 2C. (x) =0} AP 0 = AP [B(C) L 0 ((l, )) = L(l) [{ 2B(C) = } transition relation! 0 is defined by the following two rules: 1. discrete transition (l, )! 0 (l 0, 0 ) if the following four conditions hold: (a) there exists a transition l,,! l 0 in TA (b) = (c) 0 = [! 0] (d) 0 = Inv(l 0 ) 2. delay transition (l, ) d! 0 (l, + d) if the following condition holds: (a) + d = Inv(l) This means that a TA can take a discrete transition if the clock guard is true and after resetting all clocks specified on the transition the location invariant of the target invariant holds. A TA can take a delay transition if the amount of delay is such that the location invariant is maintained. Otherwise, delaying is not allowed. Note that any Timed Transition System has the following properties:
5 10.3. TIME DIVERGENCE, TIMELOCK, AND ZENO 71 Null delay It is always possible to delay for 0 time units. That is, the following transition is always present: (l, ) 0! (l, ) Time additivity There are uncountably many ways to let time pass: s d1+d2! s 0 if and only if s d1! s 00 d 2! s 0 Time determinism There is exactly one state reached after a given delay: {s 0 s d! s 0 } =1 Remark It is important to notice that executing an action occurs in zero time. Time is only increased on delay transition Time divergence, timelock, and Zeno The semantics of a Timed Automaton is given by a transition system with uncountably many states and transitions. The paths of this transition system represent possible behaviours of the timed automaton. Because of the infinite and dense structure of the state space, not all behaviours are realistic. We will see that some unrealistic behaviours are flaws in models and can be avoided. Some other behaviours are intrinsic characteristics of a dense set. These unrealistic behaviours cannot be avoided Time divergence The notion of time divergence applies to a path. A path is time divergent if the sum of the delays over this path is infinite. In contrast, time convergence identifies a path for which the sum of the delays are bounded by some natural numbers. Consider the following sequence: 1 2, 3 4, 7 8, This sequence corresponds to the following infinite sum: 1X i=0 i which is known to converge to 1. Now consider a clock x and a location l with the following invariant Inv(l) =x apple 1. There is nothing in the theory of timed automata that precludes the execution where time increase according to the sequence below. That is, the following is a execution fragment in location l: (l, 0)(l, 1 2 )(l, 7 15 )(l, 8 16 )...
6 72 CHAPTER 10. TIMED AUTOMATA Such a path is called time convergent as time over this path will never increase about a constant, in that case, the natural number 1. Such paths are unrealistic behaviours but cannot be avoided in the theory. When analysing Timed Automata we will always ignore time convergent paths and only consider time divergent ones, that is, paths for which time can always make progress. To formalise the notion of time divergence we first define a function computing the time elapsed on a path. Definition (Elapsed time on a path) Given a timed automaton TA with actions in Act, we define function ExecTime : Act [ IR +! IR + as follows: ( 0 if 2 Act ExecTime( ) = d if = d 2 IR + For an infinite execution = s 0 0! s 1 1! s 2... with i 2 Act [ IR +, we define the elapsed time over this fragment is defined as follows: ExecTime( ) = 1X ExecTime( i ) i=0 For the path induced by execution we define: ExecTime( ) =ExecTime( ) We can now formulate a precise definition of time divergence: Definition (Time divergence) An infinite path fragment is time divergent if and only if ExecTime( ) =1. Otherwise, the path fragment is time convergent. We now define the set of time divergent paths for a given state of the transition system obtained from a timed automaton. Definition (Time divergent set of paths) Given a state s of the transition system TS(TA), we define the set of time divergent paths as follows: Paths div (s) ={ 2 Paths(s) ExecTime( ) =1} Note that time convergent paths cannot be avoided. In practice, such path are simply ignored, that is, an invariant holds in a state if and only if it holds for all time divergent paths starting in that state Timelock A state contains a timelock is there exist no time divergent paths starting from that state. Definition (Timelock) Given a state s of TS(TA), s has a timelock if and only if Paths div (s) =;. ATA is timelock-free if and only if no state in Reach(TS(TA)) has a timelock.
7 10.4. PARALLEL COMPOSITION 73 In contrast to time convergent paths that cannot be avoided, timelocks are flaws in models and must be avoided Zeno In the theory of Timed Automata, actions occur in zero time. This means, that nothing precludes executions of infinitely many actions in finite time. That is, a timed automaton may have time convergent paths with an infinite number of actions. Definition (Zeno path) An infinite path of a transition system TS(TA) is zeno if and only it is time convergent and the number of actions executed along is infinite. Definition (Nonzeno timed automaton) A timed automaton TA is nonzeno if and only if all initial states of TS(TA) have no zeno paths Parallel composition To model complex systems, a good approach is to first build simple blocks. Second, these basic blocks are composed to form a more complex system. We consider the composition of timed automata using handshaking communications. The idea is to define a set of handshaking actions, called H. Two timed automata communicate via H by performing actions in H together. That is, the two timed automata need to synchronise on all actions in H. For actions outside H, each automaton evolves independently of the other automaton. Formally, this composition is defined as follows: Definition (Handshaking for timed automata) Given two timed automata TA 1 = (Loc 1, Loc 0,1, Act 1, C 1,! 1, Inv 1, AP 1, L 1 ) and TA 2 =(Loc 2, Loc 0,2, Act 2, C 2,! 2, Inv 2, AP 2, L 2 ), such that AP 1 \ AP 2 = ; and C 1 \C 2 = ;. We define the set of handshaking actions: H Act 1 \ Act 2 and the parallel composition of TA 1 and TA 2 via H as TA 1 H TA 2 = (Loc 1 Loc 2, Loc 0,1 Loc 0,2, Act 1 [ Act 2, C 1 [C 2,!, Inv, AP 1 [ AP 2,L) where L((l 1,l 1 )) = L 1 (l 1 ) [ L 2 (l 2 ) Inv((l 1,l 2 )) = Inv(l 1 ) ^ Inv(l 2 ) and the transition relation! is defined by the following rules: for 2 H l 1, 1, 1! 1 l 1 ^ l 2, 2, 2! 2 l 2 (l 1,l 2 ), 1^ 2, 1[ 2! (l 1,l 2 )
8 74 CHAPTER 10. TIMED AUTOMATA for 62 H l 1,,! 1 l 1 (l 1,l 2 ),,! (l 1,l 2 ) and l 2,,! 2 l 2 (l 1,l 2 ),,! (l 1,l 2 ) Composition can only take place between two compatible timed automata. Two timed automata are compatible is they have disjoints sets of atomic propositions (AP 1 \ AP 2 = ;) and clock variables (C 1 \C 2 = ;). The invariants of the resulting timed automaton is the pairwise conjunction of each location invariant. The same holds for the atomic propositions. For any action in the set of handshaking actions, the transition for this action is guarded by the conjunction of the clock guards and the set of the clocks to be reset is the union of each reset set Conclusion This chapter introduced the main definitions of the theory of Timed Automata. Clock variables and clock constraints are introduced to specify constraints on the time at which actions may occur. Introducing time brings about the issue of time convergence, that is, paths may only allow time to increase up to a given bound. Such time convergent paths cannot be avoided and have to be ignored in the analysis. In contrast, timelocks occur in state without any time divergent path. Timelocks are flaws and must be avoided. The same holds for zeno paths. A path is zeno when it is time convergent and has infinitely many actions. Finally, we defined composition rules to combine two timed automata using a set of handshaking actions Exercises See instructions 4 and 5 on the course website jschmalt/ teaching/2ix20/2ix20.html.
Linear Temporal Logic (LTL)
Chapter 9 Linear Temporal Logic (LTL) This chapter introduces the Linear Temporal Logic (LTL) to reason about state properties of Labelled Transition Systems defined in the previous chapter. We will first
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 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 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 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 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 informationTimo Latvala. February 4, 2004
Reactive Systems: Temporal Logic LT L Timo Latvala February 4, 2004 Reactive Systems: Temporal Logic LT L 8-1 Temporal Logics Temporal logics are currently the most widely used specification formalism
More informationVerification and Control of Partially Observable Probabilistic Systems
Verification and Control of Partially Observable Probabilistic Systems Gethin Norman 1, David Parker 2, and Xueyi Zou 3 1 School of Computing Science, University of Glasgow, UK 2 School of Computer Science,
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 informationWeek 4 solutions. March 21, From the left hand side formula we obtain ϕ ψ = ϕ ψ = We transform the left hand side formula as follows.
Week 4 solutions March 21, 2017 1 a. ϕ ψ ϕ (ψ ϕ). From the left hand side formula we obtain ϕ ψ = ϕ ψ = ϕ ψ = (ψ ϕ) = True (ψ ϕ). Here, True = (ψ ϕ) ( ψ ϕ) (ψ ϕ) ( ψ ϕ). In True (ψ ϕ), only ( ψ ϕ) can
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 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 informationAbstracting real-valued parameters in parameterised boolean equation systems
Department of Mathematics and Computer Science Formal System Analysis Research Group Abstracting real-valued parameters in parameterised boolean equation systems Master Thesis M. Laveaux Supervisor: dr.
More informationarxiv: v1 [cs.lo] 17 Jun 2014
On MITL and alternating timed automata over infinite words Thomas Brihaye 1, Morgane Estiévenart 1, and Gilles Geeraerts 2 1 UMons, Belgium, 2 U.L.B., Belgium arxiv:1406.4395v1 [cs.lo] 17 Jun 2014 Abstract.
More informationLogic Model Checking
Logic Model Checking Lecture Notes 10:18 Caltech 101b.2 January-March 2004 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. the assignment
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems Algorithmic analysis for linear hybrid systems Prof. Dr. Erika Ábrahám Informatik 2 - Theory of Hybrid Systems RWTH Aachen University SS 2015 Ábrahám - Hybrid Systems
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 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 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 informationTime and Timed Petri Nets
Time and Timed Petri Nets Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr DISC 11, June 9th 2011 1 Time and Petri Nets 2 Timed Models 3 Expressiveness 4 Analysis 1/36 Outline 1 Time
More informationDiscrete abstractions of hybrid systems for verification
Discrete abstractions of hybrid systems for verification George J. Pappas Departments of ESE and CIS University of Pennsylvania pappasg@ee.upenn.edu http://www.seas.upenn.edu/~pappasg DISC Summer School
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 informationDecidability Results for Probabilistic Hybrid Automata
Decidability Results for Probabilistic Hybrid Automata Prof. Dr. Erika Ábrahám Informatik 2 - Theory of Hybrid Systems RWTH Aachen SS09 - Probabilistic hybrid automata 1 / 17 Literatur Jeremy Sproston:
More informationVisibly Linear Dynamic Logic
Visibly Linear Dynamic Logic Joint work with Alexander Weinert (Saarland University) Martin Zimmermann Saarland University September 8th, 2016 Highlights Conference, Brussels, Belgium Martin Zimmermann
More informationUndecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae XXI (2001) 1001 1025 1001 IOS Press Undecidability Results for Timed Automata with Silent Transitions Patricia Bouyer LSV, ENS Cachan, CNRS, France bouyer@lsv.ens-cachan.fr Serge
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 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 informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probabilistic Model Checking Michaelmas Term 2011 Dr. Dave Parker Department of Computer Science University of Oxford Overview Temporal logic Non-probabilistic temporal logic CTL Probabilistic temporal
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 informationProperty Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms
Property Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms Wen-ling Huang and Jan Peleska University of Bremen {huang,jp}@cs.uni-bremen.de MBT-Paradigm Model Is a partial
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 informationChapter 3: Linear temporal logic
INFOF412 Formal verification of computer systems Chapter 3: Linear temporal logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 LTL: a specification
More informationLecture 2 Automata Theory
Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray Outline: Transition systems Linear-time properties Regular propereties EECI, 14 May 2012 This short-course is on this picture applied
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 informationTransition Systems and Linear-Time Properties
Transition Systems and Linear-Time Properties Lecture #1 of Principles of Model Checking Joost-Pieter Katoen Software Modeling and Verification Group affiliated to University of Twente, Formal Methods
More informationModel for reactive systems/software
Temporal Logics CS 5219 Abhik Roychoudhury National University of Singapore The big picture Software/ Sys. to be built (Dream) Properties to Satisfy (caution) Today s lecture System Model (Rough Idea)
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 informationLecture 2 Automata Theory
Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray EECI, 18 March 2013 Outline Modeling (discrete) concurrent systems: transition systems, concurrency and interleaving Linear-time
More informationSafety and Liveness Properties
Safety and Liveness Properties Lecture #6 of Model Checking Joost-Pieter Katoen Lehrstuhl 2: Software Modeling and Verification E-mail: katoen@cs.rwth-aachen.de November 5, 2008 c JPK Overview Lecture
More informationSpiking Neural Networks as Timed Automata
Spiking Neural Networks as Timed Automata Giovanni Ciatto 1,2, Elisabetta De Maria 2, and Cinzia Di Giusto 2 1 Università di Bologna, Italy 2 Université Côté d Azur, CNRS, I3S, France Abstract In this
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
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 informationSoftware Verification
Software Verification Grégoire Sutre LaBRI, University of Bordeaux, CNRS, France Summer School on Verification Technology, Systems & Applications September 2008 Grégoire Sutre Software Verification VTSA
More informationTrading Infinite Memory for Uniform Randomness in Timed Games
Trading Infinite Memory for Uniform Randomness in Timed Games Krishnendu Chatterjee Thomas A. Henzinger Vinayak Prabhu Electrical Engineering and Computer Sciences University of California at Berkeley
More informationLTL is Closed Under Topological Closure
LTL is Closed Under Topological Closure Grgur Petric Maretić, Mohammad Torabi Dashti, David Basin Department of Computer Science, ETH Universitätstrasse 6 Zürich, Switzerland Abstract We constructively
More informationAutomatic Verification of Real-time Systems with Discrete Probability Distributions
Automatic Verification of Real-time Systems with Discrete Probability Distributions Marta Kwiatkowska a, Gethin Norman a, Roberto Segala b and Jeremy Sproston a a University of Birmingham, Birmingham B15
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 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 informationTime-abstracting Bisimulation for Probabilistic Timed Automata
Time-abstracting Bisimulation for Probabilistic Timed Automata Taolue Chen CWI PO Box 94079, 1090 GB Amsterdam, The Netherlands chen@cwi.nl Tingting Han Joost-Pieter Katoen MOVES, RWTH Aachen University,
More informationDense-Timed Pushdown Automata
Dense-Timed Pushdown Automata Parosh Aziz Abdulla Uppsala University Sweden Mohamed Faouzi Atig Uppsala University Sweden Jari Stenman Uppsala University Sweden Abstract We propose a model that captures
More informationSaarland University Faculty of Natural Sciences and Technology I Department of Computer Science. Bachelor Thesis. From Uppaal To Slab.
Saarland University Faculty of Natural Sciences and Technology I Department of Computer Science Bachelor Thesis From Uppaal To Slab submitted by Andreas Abel submitted August 26, 2009 Supervisor Prof.
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 informationClasses and conversions
Classes and conversions Regular expressions Syntax: r = ε a r r r + r r Semantics: The language L r of a regular expression r is inductively defined as follows: L =, L ε = {ε}, L a = a L r r = L r L r
More informationPart I. Principles and Techniques
Introduction to Formal Methods Part I. Principles and Techniques Lecturer: JUNBEOM YOO jbyoo@konkuk.ac.kr Introduction Text System and Software Verification : Model-Checking Techniques and Tools In this
More informationLecture 6: Reachability Analysis of Timed and Hybrid Automata
University of Illinois at Urbana-Champaign Lecture 6: Reachability Analysis of Timed and Hybrid Automata Sayan Mitra Special Classes of Hybrid Automata Timed Automata ß Rectangular Initialized HA Rectangular
More informationTopics in Verification AZADEH FARZAN FALL 2017
Topics in Verification AZADEH FARZAN FALL 2017 Last time LTL Syntax ϕ ::= true a ϕ 1 ϕ 2 ϕ ϕ ϕ 1 U ϕ 2 a AP. ϕ def = trueu ϕ ϕ def = ϕ g intuitive meaning of and is obt Limitations of LTL pay pay τ τ soda
More informationBridging the Semantic Gap Between Heterogeneous Modeling Formalisms and FMI
Bridging the Semantic Gap Between Heterogeneous Modeling Formalisms and FMI Stavros Tripakis Aalto University and University of California, Berkeley Abstract FMI (Functional Mockup Interface) is a standard
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 informationChapter 6: Computation Tree Logic
Chapter 6: Computation Tree Logic Prof. Ali Movaghar Verification of Reactive Systems Outline We introduce Computation Tree Logic (CTL), a branching temporal logic for specifying system properties. A comparison
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 informationSynthesis weakness of standard approach. Rational Synthesis
1 Synthesis weakness of standard approach Rational Synthesis 3 Overview Introduction to formal verification Reactive systems Verification Synthesis Introduction to Formal Verification of Reactive Systems
More informationAutomata-Theoretic Model Checking of Reactive Systems
Automata-Theoretic Model Checking of Reactive Systems Radu Iosif Verimag/CNRS (Grenoble, France) Thanks to Tom Henzinger (IST, Austria), Barbara Jobstmann (CNRS, Grenoble) and Doron Peled (Bar-Ilan University,
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 informationFORMAL METHODS LECTURE III: LINEAR TEMPORAL LOGIC
Alessandro Artale (FM First Semester 2007/2008) p. 1/39 FORMAL METHODS LECTURE III: LINEAR TEMPORAL LOGIC Alessandro Artale Faculty of Computer Science Free University of Bolzano artale@inf.unibz.it http://www.inf.unibz.it/
More informationOverview. overview / 357
Overview overview6.1 Introduction Modelling parallel systems Linear Time Properties Regular Properties Linear Temporal Logic (LTL) Computation Tree Logic syntax and semantics of CTL expressiveness of CTL
More informationZone-Based Reachability Analysis of Dense-Timed Pushdown Automata
IT 12 034 Examensarbete 15 hp Juli 2012 Zone-Based Reachability Analysis of Dense-Timed Pushdown Automata Kristiina Ausmees Institutionen för informationsteknologi Department of Information Technology
More informationInterval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture
Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture D.Bresolin, D. Della Monica, A. Montanari, P. Sala, G. Sciavicco ICE-TCS, School of Computer Science, Reykjavik University,
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 informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
More informationTemporal 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 informationVerification of Polynomial Interrupt Timed Automata
Verification of Polynomial Interrupt Timed Automata Béatrice Bérard 1, Serge Haddad 2, Claudine Picaronny 2, Mohab Safey El Din 1, Mathieu Sassolas 3 1 Université P. & M. Curie, LIP6 2 ENS Cachan, LSV
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems 5. Linear hybrid automata I Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October
More informationModeling and Analysis of Hybrid Systems Linear hybrid automata I Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017
More informationProbabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol 1
Under consideration for publication in Formal Aspects of Computing Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol 1 Marta Kwiatkowska a, Gethin Norman
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 informationLinear-Time Logic. Hao Zheng
Linear-Time Logic Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757 Fax: (813)974-5456 Hao Zheng (CSE, USF)
More informationClock Matrix Diagrams
Clock Matrix Diagrams U N I V E R S I T A S S A R A V I E N I S S Bachelor s Thesis Daniel Fass daniel@react.cs.uni-sb.de Reactive Systems Group Department of Computer Science Universität des Saarlandes
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 informationAlternating-Time Temporal Logic
Alternating-Time Temporal Logic R.Alur, T.Henzinger, O.Kupferman Rafael H. Bordini School of Informatics PUCRS R.Bordini@pucrs.br Logic Club 5th of September, 2013 ATL All the material in this presentation
More informationWhat is Temporal Logic? The Basic Paradigm. The Idea of Temporal Logic. Formulas
What is Temporal Logic? A logical formalism to describe sequences of any kind. We use it to describe state sequences. An automaton describes the actions of a system, a temporal logic formula describes
More informationTemporal & Modal Logic. Acronyms. Contents. Temporal Logic Overview Classification PLTL Syntax Semantics Identities. Concurrency Model Checking
Temporal & Modal Logic E. Allen Emerson Presenter: Aly Farahat 2/12/2009 CS5090 1 Acronyms TL: Temporal Logic BTL: Branching-time Logic LTL: Linear-Time Logic CTL: Computation Tree Logic PLTL: Propositional
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 informationWeak Alternating Timed Automata
Weak Alternating Timed Automata Pawel Parys 1 and Igor Walukiewicz 2 1 Warsaw University,Poland 2 LaBRI, CNRS and Bordeaux University, France Abstract. Alternating timed automata on infinite words are
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 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 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 informationBridging the Semantic Gap Between Heterogeneous Modeling Formalisms and FMI
Bridging the Semantic Gap Between Heterogeneous Modeling Formalisms and FMI Stavros Tripakis David Broman Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report
More informationA Proof System for Timed Automata
A Proof System for Timed Automata Huimin Lin 1 and Wang Yi 2 1 Laboratory for Computer Science Institute of Software, Chinese Academy of Sciences lhm@ox.ios.ac.cn 2 Department of Computer Systems Uppsala
More informationDetecting Synchronisation of Biological Oscillators by Model Checking
Detecting Synchronisation of Biological Oscillators by Model Checking Ezio Bartocci, Flavio Corradini, Emanuela Merelli, Luca Tesei School of Sciences and Technology, University of Camerino, Via Madonna
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 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 informationTask Automata: Schedulability, Decidability and Undecidability
Task Automata: Schedulability, Decidability and Undecidability Elena Fersman 1, Pavel Krcal, Paul Pettersson 2 and Wang Yi 3 Email: fpavelk,paupet,yig@it.uu.se Department of Information Technology Uppsala
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 informationTimed Test Generation Based on Timed Temporal Logic
Timed Test Generation Based on Timed Temporal Logic STEFAN D. BRUDA and CHUN DAI Department of Computer Science Bishop s University Sherbrooke, Quebec J1M 1Z7 CANADA stefan@bruda.ca, cdai@cs.ubishops.ca
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 informationTemporal Logic. M φ. Outline. Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness. Ralf Huuck. Kripke Structure
Outline Temporal Logic Ralf Huuck Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness Model Checking Problem model, program? M φ satisfies, Implements, refines property, specification
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 informationAutomata on Infinite words and LTL Model Checking
Automata on Infinite words and LTL Model Checking Rodica Condurache Lecture 4 Lecture 4 Automata on Infinite words and LTL Model Checking 1 / 35 Labeled Transition Systems Let AP be the (finite) set of
More informationModeling & Control of Hybrid Systems. Chapter 7 Model Checking and Timed Automata
Modeling & Control of Hybrid Systems Chapter 7 Model Checking and Timed Automata Overview 1. Introduction 2. Transition systems 3. Bisimulation 4. Timed automata hs check.1 1. Introduction Model checking
More information