Software Specification 2IX20
|
|
- Vanessa Patrick
- 5 years ago
- Views:
Transcription
1 Software Specification 2IX20 Julien Schmaltz (with slides jointly with J. Tretmans, TNO&RUN) Lecture 13: Model-Based Testing III (real-timed systems)
2 Correctness Implementation Relation ioco i ioco s = def σ Straces (s) : out (i after σ) out (s after σ) Intuition: i ioco-conforms to s, iff if i produces output x after trace σ, then s can produce x after σ if i cannot produce any output after trace σ, then s cannot produce any output after σ ( quiescence δ )
3 Correctness Implementation Relation ioco i ioco s = def σ Straces (s) : out (i after σ) out (s after σ) δ ( p ) = L U {τ}. p Straces ( s ) = { σ ( L { δ } )* s σ } out ( p ) = { L U p } { δ δ ( p ) } out ( P ) = { out ( p ) p P } p after σ = { p p σ p }
4 Implementation Relation ioco 2 2 ioco ioco!tea!choc 2 δ!tea s? but2 2 ioco ioco!tea!choc
5 ?a?a?b τ δ?b?b!y!y (i) (s) Is (i) ioco-conforming to (s)? out (?a δ?b) =?
6 Timed Model-Based Testing!Aim: understand more about real-time implementation relations which ones are useful and intuitive compare relations from the literature find constraints under which different relations are equal allow tool comparison: Uppaal-TRON, TTG, Timed-TorX!Challenges: Is time input or output? Quiescence: How long is there never eventually no output?
7 Timed Model-Based Testing!In many systems real-time properties are crucial!approach: Extension of IOLTS/ioco theory Timed Input Output Transition Systems (TIOTS) Timed Implementation Relations: build on ioco Note that there are also approaches for timed FSM
8 Timed Model-Based Testing!Literature (only for transition systems): Krichen, Tripakis: tiocogre Nielsen, Mikucionis, Skou, Larsen: rtioco Brandán Briones, Brinksma: tiocom Bohnenkamp, Belinfante (Timed TorX) Khoumsi, Jéron, Marchand Schmaltz, Tretmans: tioco, tioco η,tioco ζ
9 Timed Automata: Examples [c <= 5] the system may produce within 5 time units, or no output is ever produced [c >= 5] [c<=5] the system must produce within 5 time units the system may produce (after 5 time units) at any time, or no output is ever produced
10 Simple testing questions Is (i) a valid implementation of (s)? (i) (s)!y How long do we need to reject (i)? (i) (s)
11 UPPAAL-TRON
12 Conformance relation: relativized conformance!developed by Nielsen, Mikucionis, Skou, Larsen: Conformance relation: rtioco e relative to an environment!based on UPPAAL s engine for Timed Automata Timed traces?a 2 3 0,4?b!y ttraces ( s ) = { σ ( L R 0 )* s σ } Output set µ out aa (q) = { µ L U R 0 q } Confto i rtioco e s = def σ ttraces (e) : out aa (i e after t σ) out aa (s e after t σ)
13 Output set of rtioco e [c<=b] [c <= b]?a?a τ?a τ [c < M] R 0 { } R 0 { } R 0 { } [0:b] R 0 R 0 R 0 µ out aa (q) = { µ L U R 0 q }
14 relativized conformance!issues to compose with the environment the specification must be input-enabled conformance is only relative to an environment that has to be defined!solution Variation of rtioco e defined in a way similar to ioco i tioco aa s = def σ ttraces (s) : out aa (i after t σ) out aa (s after t σ) Proposition. Let i,s be two input-enabled TIOTS(L I,L U ). Let e be an input-enabled TIOTS(L U,L I ). Then, we have (i e) tioco aa (s e) iff i rtioco e s
15 Is (i) a valid implementation of (s)? (i) (s) i tioco aa s = def σ ttraces (s) : out aa (i after t σ) out aa (s after t σ) µ out aa (q) = { µ L U R 0 q }
16 ?a?a?b τ?b?b!y!y (i) (s) i tioco aa s = def σ ttraces (s) : out aa (i after t σ) out aa (s after t σ) µ out aa (q) = { µ L U R 0 q }
17 tioco: Examples c:=0 c<=7 tioco tioco c:=0 c<=9 c==7 c>=3 c:=0 c<10 c>=5 c:=0 c<9 c>=7 tioco tioco c:=0 true
18 Test Generation Algorithm Z := {(s 0, e 0 )} while Z #iterations T do switch(action, delay, restart) randomly: action: // offer an input if EnvOutput(Z) // there is a possible input randomly choose i EnvOutput(Z) send i to IUT, Z := Z after t i delay: // wait for an output randomly choose d Delays(Z) sleep for d time units or wake up on output o at d d if o occurs then Z := Z after t d if o ImpOutput(Z) then return fail else Z:= Z after t o else Z := Z after t d // no output during delay d restart: Z := {(s 0, e 0 )}, reset IUT If Z = then return fail else return pass
19 Test Generation: Examples (1) Some test runs: c:=0 c:=0 but 7 coffee pass c<10 c<=7 but 3 4 coffee pass c>=5 c==7 100 but 7 coffee pass (s) (i 1 ) action: // offer an input if EnvOutput(Z) // there is a possible input randomly choose i EnvOutput(Z) send i to IUT, Z := Z after t i!but (e)?coffee delay: // wait for an output randomly choose d Delays(Z) sleep for d time units or wake up on output o at d d if o occurs then Z := Z after t d if o ImpOutput(Z) then return fail else Z:= Z after t o else Z := Z after t d // no output during delay d
20 Test Generation: Examples (2) Some test runs: c:=0 c:=0 but 7 coffee pass c<10 c<=9 but 9 coffee pass c>=5 c>=3 but 3 coffee fail (s) (i 2 ) action: // offer an input if EnvOutput(Z) // there is a possible input randomly choose i EnvOutput(Z) send i to IUT, Z := Z after t i!but (e)?coffee delay: // wait for an output randomly choose d Delays(Z) sleep for d time units or wake up on output o at d d if o occurs then Z := Z after t d if o ImpOutput(Z) then return fail else Z:= Z after t o else Z := Z after t d // no output during delay d
21 Test Generation: Completeness!The test generation algorithm is sound w.r.t to rtioco e!the test generation algorithm is exhaustive for rtioco e in the limit, i.e., when T if not (i rtioco e s) then the algorithm detects the error with probability 1!Assumptions on the IUT IUT is a non-blocking input-enabled TIOTS IUT is deterministic IUT has isolated outputs
22 Simple testing questions (i) (s) Is (i) a valid implementation of (s)? (i)!y (s) How long do we need to reject (i)?... very long...
23 UPPAAL-TRON!Implemented as an extension UPPAAL Relativized conformance On-the-fly test generation Application to (few) case-studies Seems feasible in practice!issues Strong test hypothesis Infinite output set Completeness if tests run an infinite amount of time Backward compatibility with ioco!related work Off-line generation using timed game (UPPAAL-TIGA) TTG tool (on-the-fly) by Krichen and Tripakis Timed-TorX
Testing of real-time systems IOCO
Testing of real-time systems IOCO Brian Nielsen bnielsen@cs.aau.dk With Kim Larsen, Marius Mikucionis, Arne Skou Automated Model Based Conformance Testing x>=2 Model DBLclick! click? x:=0 click? x
More informationReal-time Systems Part 4: Online Testing
Model-based d Testing of Real-time Systems Part 4: Online Testing Brian Nielsen bnielsen@cs.aau.dk With Kim Larsen, Marius Mikucionis, Arne Skou Automated Model Based Conformance Testing x>=2 Model DBLclick!
More informationModel Based Testing : principles and applications in the context of timed systems
A. Rollet - ETR2011 - Brest (France) - August 2011 1/63 Model Based Testing : principles and applications in the context of timed systems Antoine Rollet Université de Bordeaux - LaBRI (UMR CNRS 5800),
More informationOnline Testing of Real-Time Systems Using UPPAAL
Online Testing of Real-Time Systems Using UPPAAL Kim G. Larsen, Marius Mikucionis, and Brian Nielsen Department of Computer Science, Aalborg University, Fredrik Bajers Vej 7B, 9220 Aalborg Ø st, Denmark
More informationModel-based conformance test generation for timed systems
Model-based conformance test generation for timed systems Thierry Jéron Joint work with Nathalie Bertrand, Amélie Stainer, Moez Krichen INRIA Rennes - Bretagne Atlantique, France Thierry.Jeron@inria.fr
More informationSoftware Specification 2IX20
Software Specification 2IX20 Julien Schmaltz (with slides jointly with J. Tretmans, TNO&RUN) Lecture 11: Introduction to Model-Based Testing Context & Motivation Testing Testing: checking or measuring
More informationTimed Testing with TorX
Timed Testing with TorX Henrik Bohnenkamp and Axel Belinfante Formal Methods and Tools Department of Computer Science, University of Twente Postbus 217, NL-7500 AE Enschede, The Netherlands {bohnenka belinfan}@cs.utwente.nl
More informationA Simplified Approach for Testing Real-Time Systems Based on Action Refinement
A Simplified Approach for Testing Real-Time Systems Based on Action Refinement Saddek Bensalem, Moez Krichen, Lotfi Majdoub, Riadh Robbana, Stavros Tripakis Verimag Laboratory, Centre Equation 2, avenue
More informationCompositional Random Testing using Extended Symbolic Transition Systems
Compositional Random Testing using Extended Symbolic Transition Systems Christian Schwarzl 1, Bernhard K. Aichernig 2, and Franz Wotawa 2 1 Virtual Vehicle, Inffeldgasse 21a, 8010 Graz, Austria, christian.schwarzl@v2c2.at
More informationModel Based Testing of Embedded Systems
Model Based Testing of Embedded Systems Brian Nielsen Arne Skou {bnielsen ask}@cs.auc.dk Automated Model Based Conformance Testing x>=2 Model DBLclick! click? x:=0 click? x
More informationioco theory for probabilistic automata
ioco theory for probabilistic automata Marcus Gerhold Mariëlle Stoelinga University of Twente, Enschede, The Netherlands m.gerhold@utwente.nl marielle@cs.utwente.nl Model-based testing MBT) is an well-known
More informationControl strategies for off-line testing of timed systems
Control strategies for off-line testing of timed systems Léo Henry, Thierry Jéron, and Nicolas Markey Univ. Rennes, INRIA & CNRS, Rennes (France) Abstract. Partial observability and controllability are
More informationTimed Testing under Partial Observability
Timed Testing under Partial Observability Alexandre David, Kim G. Larsen, Shuhao Li, Brian Nielsen Center for Embedded Software Systems (CISS) Aalborg University DK-9220 Aalborg, Denmark {adavid, kgl,
More informationA Semantic Framework for Test Coverage
A Semantic Framework for Test Coverage Laura Brandán Briones +, Ed Brinksma +, and Mariëlle Stoelinga + + Faculty of Computer Science, University of Twente, The Netherlands Embedded Systems Institute,
More informationProbabilistic testing coverage
Probabilistic testing coverage NICOLAE GOGA Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven THE NETHERLANDS Abstract: This paper describes a way to compute the coverage for an on-the-fly
More informationA General Testability Theory: Classes, properties, complexity, and testing reductions
A General Testability Theory: Classes, properties, complexity, and testing reductions presenting joint work with Luis Llana and Pablo Rabanal Universidad Complutense de Madrid PROMETIDOS-CM WINTER SCHOOL
More informationAutomated model-based testing of hybrid systems
Automated model-based testing of hybrid systems van Osch, M.P.W.J. DOI: 10.6100/IR640216 Published: 01/01/2009 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue
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 informationOff-Line Test Selection with Test Purposes for Non-deterministic Timed Automata
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata Nathalie Bertrand 1, Thierry Jéron 1,Amélie Stainer 1, and Moez Krichen 2 1 INRIA Rennes - Bretagne Atlantique, Rennes, France
More informationOff-line Test Case Generation For Timed Symbolic Model-Based Conformance Testing
Off-line Test Case Generation For Timed Symbolic Model-Based Conformance Testing Boutheina Bannour 1, Jose Pablo Escobedo 2, Christophe Gaston 2 and Pascale Le Gall 3 1 Sherpa Engineering, 92250, La Garenne
More informationModel Based Testing -- FSM based testing
Model Based Testing -- FSM based testing Brian Nielsen {bnielsen}@cs.aau.dk Automated Model Based Conformance Testing x>=2 Model DBLclick! click? x:=0 click? x
More informationPDF hosted at the Radboud Repository of the Radboud University Nijmegen
PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a preprint version which may differ from the publisher's version. For additional information about this
More informationModel-based testing. NATO Summer School Marktoberdorf, August, Ed Brinksma University of Twente
Model-based testing NATO Summer School Marktoberdorf, August, 2012 Ed Brinksma University of Twente CONTENTS 1. Introduction control-oriented testing 2. Input-output conformance testing 3. Real-time conformance
More informationMonitoring Dynamical Signals while Testing Timed Aspects of a System
Monitoring Dynamical Signals while Testing Timed Aspects of a System Goran Frehse 1, Kim G. Larsen 2, Marius Mikučionis 2, and Brian Nielsen 2 1 Verimag (UJF-CNRS-INPG), 2, av. de Vignate, 38610 Gieres,
More informationRemote Testing of Timed Specifications
Remote Testing of Timed Specifications Alexandre David 1, Kim G. Larsen 1, Marius Mikučionis 1, Omer L. Nguena Timo 2, Antoine Rollet 2 1 Department of Computer Science, Aalborg University, Denmark { adavid,
More informationTheories for Model-based Testing: Real-time and Coverage. Laura Brandán Briones
Theories for Model-based Testing: Real-time and Coverage Laura Brandán Briones Graduation committee: Prof. Dr. H. Brinksma (promotor) Prof. Dr. J. W. Fokkink Prof. Dr. P. H. Hartel Prof. Dr. K. G. Larsen
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 informationConformance Testing Relations for Timed Systems
Conformance Testing Relations for Timed Systems Manuel Núñez and Ismael Rodríguez Dept. Sistemas Informáticos y Programación Universidad Complutense de Madrid, E-28040 Madrid. Spain. e-mail: {mn,isrodrig}@sip.ucm.es
More informationEmbedded systems specification and design
Embedded systems specification and design David Kendall David Kendall Embedded systems specification and design 1 / 21 Introduction Finite state machines (FSM) FSMs and Labelled Transition Systems FSMs
More informationKim Guldstrand Larsen DENMARK
Quantitative Modal Transition Systems Kim Guldstrand Larsen Aalborg University Aalborg University, DENMARK The Early Days Edinburgh 83-85 Kim Larsen [2] Milner Symposium, Edinburgh, April 16-18, 2012 Original
More informationCompositional Specifications for ioco Testing
Compositional Specifications for ioco Testing Przemysław Daca and Thomas A. Henzinger IST Austria Klosterneuburg, Austria {przemek, tah}@ist.ac.at Willibald Krenn and Dejan Ničković AIT Austrian Institute
More informationTest generation from recursive tiles systems
Test generation from recursive tiles systems Sébastien Chédor 1, Thierry Jéron 2, Christophe Morvan 3 1 Université de Rennes I 2 INRIA Rennes - Bretagne Atlantique, 3 Université Paris-Est, Marne-La-Vallée,
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 informationCompositional Testing with IOCO
Compositional Testing with IOCO Machiel van der Bijl and Arend Rensink Software Engineering, Department of Computer Science, University of Twente P.O. Box 217, 7500 AE Enschede, The Netherlands email:
More informationCompositional Testing with IOCO
Compositional Testing with IOCO Machiel van der Bijl 1, Arend Rensink 1 and Jan Tretmans 2 1 Software Engineering, Department of Computer Science, University of Twente P.O. Box 217, 7500 AE Enschede, The
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 informationThe priority promotion approach to parity games
The priority promotion approach to parity games Massimo Benerecetti 1, Daniele Dell Erba 1, and Fabio Mogavero 2 1 Università degli Studi di Napoli Federico II 2 Università degli Studi di Verona Abstract.
More informationTimed Automata. Chapter Clocks and clock constraints Clock variables and clock constraints
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
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 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 informationarxiv: v1 [cs.fl] 14 Aug 2015
Bounded Determinization of Timed Automata with Silent Transitions arxiv:1508.03575v1 [cs.fl] 14 Aug 2015 Florian Lorber 1, Amnon Rosenmann 2, Dejan Ničković 2, and Bernhard K. Aichernig 1 1 Institute for
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 informationCOSE212: Programming Languages. Lecture 1 Inductive Definitions (1)
COSE212: Programming Languages Lecture 1 Inductive Definitions (1) Hakjoo Oh 2017 Fall Hakjoo Oh COSE212 2017 Fall, Lecture 1 September 4, 2017 1 / 9 Inductive Definitions Inductive definition (induction)
More informationCOSE212: Programming Languages. Lecture 1 Inductive Definitions (1)
COSE212: Programming Languages Lecture 1 Inductive Definitions (1) Hakjoo Oh 2018 Fall Hakjoo Oh COSE212 2018 Fall, Lecture 1 September 5, 2018 1 / 10 Inductive Definitions Inductive definition (induction)
More informationTest Generation Based on Symbolic Specifications
Test Generation Based on Symbolic Specifications Lars Frantzen, Jan Tretmans, and Tim A.C. Willemse Nijmegen Institute for Computing and Information Sciences (NIII), Radboud University Nijmegen The Netherlands
More informationCSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides
CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides First Person: Second Person: Family Name: Family Name: Given Name: Given
More informationTesting from a Finite State Machine: An introduction 1
Testing from a Finite State Machine: An introduction 1 The use of Finite State Machines (FSM) to model systems has lead to much interest in deriving tests from them. Having derived a test sequence from
More informationOnline Learning, Mistake Bounds, Perceptron Algorithm
Online Learning, Mistake Bounds, Perceptron Algorithm 1 Online Learning So far the focus of the course has been on batch learning, where algorithms are presented with a sample of training data, from which
More informationMonitoring and Fault-Diagnosis with Digital Clocks
Author manuscript, published in "6th Int. Conf. on Application of Concurrency to System Design (ACSD'06) (2006)" Monitoring and Fault-Diagnosis with Digital Clocks Karine Altisen Verimag Laboratory Karine.Altisen@imag.fr
More informationMA/CSSE 474 Theory of Computation
MA/CSSE 474 Theory of Computation CFL Hierarchy CFL Decision Problems Your Questions? Previous class days' material Reading Assignments HW 12 or 13 problems Anything else I have included some slides online
More informationAn Automatic Test Framework for Interactive Music Systems
An Automatic Test Framework for Interactive Music Systems Florent Jacquemard, Clément Poncelet To cite this version: Florent Jacquemard, Clément Poncelet. An Automatic Test Framework for Interactive Music
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 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 informationA Theory of History Dependent Abstractions for Learning Interface Automata
A Theory of History Dependent Abstractions for Learning Interface Automata Fides Aarts, Faranak Heidarian, and Frits Vaandrager Institute for Computing and Information Sciences, Radboud University Nijmegen
More informationSynchronizing Asynchronous Conformance Testing
Synchronizing Asynchronous Conformance Testing Neda Noroozi 1,2, Ramtin Khosravi 3, Mohammad Reza Mousavi 1, and Tim A.C. Willemse 1 1 Eindhoven University of Technology, Eindhoven, The Netherlands 2 Fanap
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 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 informationThe Weakest Failure Detector to Solve Mutual Exclusion
The Weakest Failure Detector to Solve Mutual Exclusion Vibhor Bhatt Nicholas Christman Prasad Jayanti Dartmouth College, Hanover, NH Dartmouth Computer Science Technical Report TR2008-618 April 17, 2008
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 14 SMALL REVIEW FOR FINAL SOME Y/N QUESTIONS Q1 Given Σ =, there is L over Σ Yes: = {e} and L = {e} Σ Q2 There are uncountably
More informationInterpreting a successful testing process: risk and actual coverage
Interpreting a successful testing process: risk and actual coverage Mariëlle Stoelinga and Mark Timmer Faculty of Computer Science, University of Twente, The Netherlands {marielle, timmer}@cs.utwente.nl
More informationFormal Testing from Timed Finite State Machines
Formal Testing from Timed Finite State Machines Mercedes G. Merayo a, Manuel Núñez a and Ismael Rodríguez a a Departamento de Sistemas Informáticos y Computación Universidad Complutense de Madrid, E-28040
More informationDeterministic Finite Automata
Deterministic Finite Automata COMP2600 Formal Methods for Software Engineering Ranald Clouston Australian National University Semester 2, 2013 COMP 2600 Deterministic Finite Automata 1 Pop quiz What is
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 informationLearning I/O Automata
Learning I/O Automata Fides Aarts and Frits Vaandrager Institute for Computing and Information Sciences, Radboud University Nijmegen P.O. Box 9010, 6500 GL Nijmegen, the Netherlands Abstract. Links are
More informationRound-off error propagation and non-determinism in parallel applications
Round-off error propagation and non-determinism in parallel applications Vincent Baudoui (Argonne/Total SA) vincent.baudoui@gmail.com Franck Cappello (Argonne/INRIA/UIUC-NCSA) Georges Oppenheim (Paris-Sud
More informationA Framework and a Tool for Robustness Testing of Communicating Software
A Framework and a Tool for Robustness Testing of Communicating Software Fares Saad-Khorchef LABRI, CNRS (UMR 5800) F-33405 Talence, France saad-kho@labri.fr Antoine Rollet LABRI, CNRS (UMR 5800) F-33405
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2017
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2017 Lecture 4 Ana Bove March 24th 2017 Structural induction; Concepts of automata theory. Overview of today s lecture: Recap: Formal Proofs
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 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 informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 4 Ana Bove March 23rd 2018 Recap: Formal Proofs How formal should a proof be? Depends on its purpose...... but should be convincing......
More informationCS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,
More informationTest Case Minimization for Real-Time Systems Using Timed Bound Traces
Test Case Minimization for Real-Time Systems Using Timed Bound Traces Ismaïl Berrada 1,RichardCastanet 1,PatrickFélix 1,andAzizSalah 2 1 LaBRI - CNRS - UMR 5800 Université Bordeaux 1, 33405 Talence cedex,
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 informationTimed Automata with Observers under Energy Constraints
Timed Automata with Observers under Energy Constraints Patricia Bouyer-Decitre Uli Fahrenberg Kim G. Larsen Nicolas Markey LSV, CNRS & ENS Cachan, France Aalborg Universitet, Danmark /9 Introduction The
More informationSynthesizing Robust Systems
Synthesizing Robust Systems Roderick Bloem and Karin Greimel (TU-Graz) Thomas Henzinger (EPFL and IST-Austria) Barbara Jobstmann (CNRS/Verimag) FMCAD 2009 in Austin, Texas Barbara Jobstmann 1 Motivation
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 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 informationALG 4.3. Hashing Polynomials and Algebraic Expressions: Main Goal of Lecture: Algorithms Professor John Reif
Algorithms Professor John Reif ALG 4.3 Hashing Polynomials and Algebraic Expressions: (a) Identity Testing of Polynomials (b) Applications of Polynomial Hashing (c) Hashing Classes of Algebraic Expressions
More informationPeled, Vardi, & Yannakakis: Black Box Checking
Peled, Vardi, & Yannakakis: Black Box Checking Martin Leucker leucker@it.uu.se Department of Computer Systems,, Sweden Plan Preliminaries State identification and verification Conformance Testing Extended
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 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 informationBuilding Finite State Machines
E H U N I V E R S I T Y T O H F R G E D I N B U Murray Cole Designing FSMs Given some reactive system, how can build an FSM to model it? From scratch, by intuition, in one go. OK for small examples. Build
More informationTWO-WAY FINITE AUTOMATA & PEBBLE AUTOMATA. Written by Liat Peterfreund
TWO-WAY FINITE AUTOMATA & PEBBLE AUTOMATA Written by Liat Peterfreund 1 TWO-WAY FINITE AUTOMATA A two way deterministic finite automata (2DFA) is a quintuple M Q,,, q0, F where: Q,, q, F are as before
More informationPlanning Under Uncertainty II
Planning Under Uncertainty II Intelligent Robotics 2014/15 Bruno Lacerda Announcement No class next Monday - 17/11/2014 2 Previous Lecture Approach to cope with uncertainty on outcome of actions Markov
More informationComputational Models: Class 1
Computational Models: Class 1 Benny Chor School of Computer Science Tel Aviv University October 19, 2015 Based on slides by Maurice Herlihy, Brown University, and modifications by Iftach Haitner and Yishay
More informationLogic: Bottom-up & Top-down proof procedures
Logic: Bottom-up & Top-down proof procedures Alan Mackworth UBC CS 322 Logic 3 March 4, 2013 P & M Textbook 5.2 Lecture Overview Recap: Soundness, Completeness, Bottom-up proof procedure Bottom-up Proof
More informationA Enforceable Security Policies Revisited
A Enforceable Security Policies Revisited DAVID BASIN, ETH Zurich VINCENT JUGÉ, MINES ParisTech FELIX KLAEDTKE, ETH Zurich EUGEN ZĂLINESCU, ETH Zurich We revisit Schneider s work on policy enforcement
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 informationRL 3: Reinforcement Learning
RL 3: Reinforcement Learning Q-Learning Michael Herrmann University of Edinburgh, School of Informatics 20/01/2015 Last time: Multi-Armed Bandits (10 Points to remember) MAB applications do exist (e.g.
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 informationAbstractions and Decision Procedures for Effective Software Model Checking
Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture
More informationAlgorithms for MDPs and Their Convergence
MS&E338 Reinforcement Learning Lecture 2 - April 4 208 Algorithms for MDPs and Their Convergence Lecturer: Ben Van Roy Scribe: Matthew Creme and Kristen Kessel Bellman operators Recall from last lecture
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 informationInterface Input/Output Automata Larsen, Kim Guldstrand; Nyman, Ulrik Mathias; Wasowski, Andrzej
Aalborg Universitet Interface Input/Output Automata Larsen, Kim Guldstrand; Nyman, Ulrik Mathias; Wasowski, Andrzej Published in: FM 2006: Formal Methods DOI (link to publication from Publisher): 10.1007/11813040_7
More informationWars of Attrition with Budget Constraints
Wars of Attrition with Budget Constraints Gagan Ghosh Bingchao Huangfu Heng Liu October 19, 2017 (PRELIMINARY AND INCOMPLETE: COMMENTS WELCOME) Abstract We study wars of attrition between two bidders who
More informationThe Leader Election Protocol (IEEE 1394)
The Leader Election Protocol (IEEE 1394) J.R. Abrial, D. Cansell, D. Méry July 2002 This Session - Background :-) - An informal presentation of the protocol :-) - Step by step formal design :- - Short
More informationTimed Games and. Stochastic Priced Timed Games
STRATEGO Timed Games and TIGA Stochastic Priced Timed Games Synthesis & Machine Learning Kim G. Larsen Aalborg University DENMARK Overview Timed Automata Decidability (regions) Symbolic Verification (zones)
More informationChapter 10 Verification and Validation of Simulation Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 10 Verification and Validation of Simulation Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose & Overview The goal of the validation process is: To produce a model that
More informationA Brief Introduction to Model Checking
A Brief Introduction to Model Checking Jan. 18, LIX Page 1 Model Checking A technique for verifying finite state concurrent systems; a benefit on this restriction: largely automatic; a problem to fight:
More information