02917 Advanced Topics in Embedded Systems. Michael R. Ha. Brief Introduction to Duration Calculus. Michael R. Hansen
|
|
|
- Lynne Lambert
- 5 years ago
- Views:
Transcription
1 Brief Introduction to Duration Calculus nsen 1 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
2 Plan for today: A motivating example wireless sensor networks Brief introduction to Duration Calculus Overview of fundamental (un)decidability results A basic decidability results with non-elementary complexity Towards efficient model checking for Duration Calculus based on approximations A decision procedure for Presburger Arithmetic At 1 pm: IMM summer party. 2 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
3 Plan for today: A motivating example wireless sensor networks Brief introduction to Duration Calculus Overview of fundamental (un)decidability results A basic decidability results with non-elementary complexity Towards efficient model checking for Duration Calculus based on approximations A decision procedure for Presburger Arithmetic At 1 pm: IMM summer party. 3 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
4 Plan for today: A motivating example wireless sensor networks Brief introduction to Duration Calculus Overview of fundamental (un)decidability results A basic decidability results with non-elementary complexity Towards efficient model checking for Duration Calculus based on approximations A decision procedure for Presburger Arithmetic At 1 pm: IMM summer party. 4 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
5 Plan for today: A motivating example wireless sensor networks Brief introduction to Duration Calculus Overview of fundamental (un)decidability results A basic decidability results with non-elementary complexity Towards efficient model checking for Duration Calculus based on approximations A decision procedure for Presburger Arithmetic At 1 pm: IMM summer party. 5 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
6 Plan for today: A motivating example wireless sensor networks Brief introduction to Duration Calculus Overview of fundamental (un)decidability results A basic decidability results with non-elementary complexity Towards efficient model checking for Duration Calculus based on approximations A decision procedure for Presburger Arithmetic At 1 pm: IMM summer party. 6 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
7 Plan for today: A motivating example wireless sensor networks Brief introduction to Duration Calculus Overview of fundamental (un)decidability results A basic decidability results with non-elementary complexity Towards efficient model checking for Duration Calculus based on approximations A decision procedure for Presburger Arithmetic At 1 pm: IMM summer party. 7 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
8 Plan for today: A motivating example wireless sensor networks Brief introduction to Duration Calculus Overview of fundamental (un)decidability results A basic decidability results with non-elementary complexity Towards efficient model checking for Duration Calculus based on approximations A decision procedure for Presburger Arithmetic At 1 pm: IMM summer party. 8 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
9 Nodes with solar panels A node of a wireless sensor network has a solar panel: 9 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
10 Energy consumption depends on usage A node has a platform consisting of several components: 10 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
11 WSN-Model using parallel automata A wireless sensor network can be modelled by parallel automata: WSN = n i=1(node i Environment i ) Node i Environment i Application i Platform i. = SolarPanel i Application i = Sun i = m i j=1 Program j Platform i = Processor i Sensor i Memory i Radio i 11 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
12 WSN-Requirements expressed in Duration Calculus Requirements can be modelled by Duration Calculus There should be sufficient energy during the lifetime: p ( l K E 0 +Σ i c i suni Σ j k j programj > 0 ) }{{}}{{} stored energy consumed energy Succinct formulation Tool support 12 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
13 WSN-Requirements expressed in Duration Calculus Requirements can be modelled by Duration Calculus There should be sufficient energy during the lifetime: p ( l K E 0 +Σ i c i suni Σ j k j programj > 0 ) }{{}}{{} stored energy consumed energy Succinct formulation Tool support 13 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
14 WSN-Requirements expressed in Duration Calculus Requirements can be modelled by Duration Calculus There should be sufficient energy during the lifetime: p ( l K E 0 +Σ i c i suni Σ j k j programj > 0 ) }{{}}{{} stored energy consumed energy Succinct formulation Tool support 14 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
15 WSN-Requirements expressed in Duration Calculus Requirements can be modelled by Duration Calculus There should be sufficient energy during the lifetime: p ( l K E 0 +Σ i c i suni Σ j k j programj > 0 ) }{{}}{{} stored energy consumed energy Succinct formulation Tool support 15 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
16 Background Provable Correct (ProCoS, ESPRIT BRA 3104) Bjørner Langmaack Hoare Olderog Project case study: Gas Burner Sørensen Ravn Rischel Intervals properties Timed Automata, Real-time Logic, Metric Temporal Logic, Explicit Clock Temporal,..., Alur, Dill, Jahanian, Mok, Koymans, Harel, Lichtenstein, Pnueli,... Duration of states Duration Calculus Zhou Hoare Ravn 91 an Interval Temporal Logic Halpern Moszkowski Manna Logical Calculi, Applications, Mechanical Support Duration Calculus: A formal approach to real-time systems Zhou Chaochen and nsen Springer 2004 Current focus: Tool support with applications 16 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
17 Background Provable Correct (ProCoS, ESPRIT BRA 3104) Bjørner Langmaack Hoare Olderog Project case study: Gas Burner Sørensen Ravn Rischel Intervals properties Timed Automata, Real-time Logic, Metric Temporal Logic, Explicit Clock Temporal,..., Alur, Dill, Jahanian, Mok, Koymans, Harel, Lichtenstein, Pnueli,... Duration of states Duration Calculus Zhou Hoare Ravn 91 an Interval Temporal Logic Halpern Moszkowski Manna Logical Calculi, Applications, Mechanical Support Duration Calculus: A formal approach to real-time systems Zhou Chaochen and nsen Springer 2004 Current focus: Tool support with applications 17 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
18 Background Provable Correct (ProCoS, ESPRIT BRA 3104) Bjørner Langmaack Hoare Olderog Project case study: Gas Burner Sørensen Ravn Rischel Intervals properties Timed Automata, Real-time Logic, Metric Temporal Logic, Explicit Clock Temporal,..., Alur, Dill, Jahanian, Mok, Koymans, Harel, Lichtenstein, Pnueli,... Duration of states Duration Calculus Zhou Hoare Ravn 91 an Interval Temporal Logic Halpern Moszkowski Manna Logical Calculi, Applications, Mechanical Support Duration Calculus: A formal approach to real-time systems Zhou Chaochen and nsen Springer 2004 Current focus: Tool support with applications 18 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
19 Background Provable Correct (ProCoS, ESPRIT BRA 3104) Bjørner Langmaack Hoare Olderog Project case study: Gas Burner Sørensen Ravn Rischel Intervals properties Timed Automata, Real-time Logic, Metric Temporal Logic, Explicit Clock Temporal,..., Alur, Dill, Jahanian, Mok, Koymans, Harel, Lichtenstein, Pnueli,... Duration of states Duration Calculus Zhou Hoare Ravn 91 an Interval Temporal Logic Halpern Moszkowski Manna Logical Calculi, Applications, Mechanical Support Duration Calculus: A formal approach to real-time systems Zhou Chaochen and nsen Springer 2004 Current focus: Tool support with applications 19 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
20 Background Provable Correct (ProCoS, ESPRIT BRA 3104) Bjørner Langmaack Hoare Olderog Project case study: Gas Burner Sørensen Ravn Rischel Intervals properties Timed Automata, Real-time Logic, Metric Temporal Logic, Explicit Clock Temporal,..., Alur, Dill, Jahanian, Mok, Koymans, Harel, Lichtenstein, Pnueli,... Duration of states Duration Calculus Zhou Hoare Ravn 91 an Interval Temporal Logic Halpern Moszkowski Manna Logical Calculi, Applications, Mechanical Support Duration Calculus: A formal approach to real-time systems Zhou Chaochen and nsen Springer 2004 Current focus: Tool support with applications 20 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
21 Background Provable Correct (ProCoS, ESPRIT BRA 3104) Bjørner Langmaack Hoare Olderog Project case study: Gas Burner Sørensen Ravn Rischel Intervals properties Timed Automata, Real-time Logic, Metric Temporal Logic, Explicit Clock Temporal,..., Alur, Dill, Jahanian, Mok, Koymans, Harel, Lichtenstein, Pnueli,... Duration of states Duration Calculus Zhou Hoare Ravn 91 an Interval Temporal Logic Halpern Moszkowski Manna Logical Calculi, Applications, Mechanical Support Duration Calculus: A formal approach to real-time systems Zhou Chaochen and nsen Springer 2004 Current focus: Tool support with applications 21 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
22 A ProCoS Case Study: Gas Burner System State variables modelling Gas and Flame: G, F : Time {0, 1} State expression modelling that gas is Leaking L ˆ= G F Requirement Gas must at most be leaking 1/20 of the elapsed time (e b) 60 s 20 e L(t)dt (e b) b 22 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
23 A ProCoS Case Study: Gas Burner System State variables modelling Gas and Flame: G, F : Time {0, 1} State expression modelling that gas is Leaking L ˆ= G F Requirement Gas must at most be leaking 1/20 of the elapsed time (e b) 60 s 20 e L(t)dt (e b) b 23 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
24 A ProCoS Case Study: Gas Burner System State variables modelling Gas and Flame: G, F : Time {0, 1} State expression modelling that gas is Leaking L ˆ= G F Requirement Gas must at most be leaking 1/20 of the elapsed time (e b) 60 s 20 e L(t)dt (e b) b 24 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
25 Gas Burner example: Design decisions Leaks are detectable and stoppable within 1s: c, d : b c < d e.(l[c, d] (d c) 1 s) where P[c, d] ˆ= d P(t) = (d c) > 0 c which reads P holds throughout[c, d] At least 30s between leaks: c, d, r, s : b c < r < s < d e. (L[c, r] L[r, s] L[s, d]) (s r) 30 s Proof obligation: Conjunction of design decisions implies the requirements. 25 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
26 Gas Burner example: Design decisions Leaks are detectable and stoppable within 1s: c, d : b c < d e.(l[c, d] (d c) 1 s) where P[c, d] ˆ= d P(t) = (d c) > 0 c which reads P holds throughout[c, d] At least 30s between leaks: c, d, r, s : b c < r < s < d e. (L[c, r] L[r, s] L[s, d]) (s r) 30 s Proof obligation: Conjunction of design decisions implies the requirements. 26 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
27 Gas Burner example: Design decisions Leaks are detectable and stoppable within 1s: c, d : b c < d e.(l[c, d] (d c) 1 s) where P[c, d] ˆ= d P(t) = (d c) > 0 c which reads P holds throughout[c, d] At least 30s between leaks: c, d, r, s : b c < r < s < d e. (L[c, r] L[r, s] L[s, d]) (s r) 30 s Proof obligation: Conjunction of design decisions implies the requirements. 27 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
28 Interval Logic - Halpern Moszkowski Manna 83 Terms: θ ::= x v θ 1 +θ n... Temporal Variable v : Intv R Formulas: φ ::= θ 1 = θ n φ φ ψ φ ψ ( x)φ... chop φ : Intv {tt,ff} Chop: { φ ψ }} { b m e } {{ } φ } {{ } ψ for some m : b m e In DC: Intv = { [a, b] a, b R a b} 28 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
29 Interval Logic - Halpern Moszkowski Manna 83 Terms: θ ::= x v θ 1 +θ n... Temporal Variable v : Intv R Formulas: φ ::= θ 1 = θ n φ φ ψ φ ψ ( x)φ... chop φ : Intv {tt,ff} Chop: { φ ψ }} { b m e } {{ } φ } {{ } ψ for some m : b m e In DC: Intv = { [a, b] a, b R a b} 29 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
30 Interval Logic - Halpern Moszkowski Manna 83 Terms: θ ::= x v θ 1 +θ n... Temporal Variable v : Intv R Formulas: φ ::= θ 1 = θ n φ φ ψ φ ψ ( x)φ... chop φ : Intv {tt,ff} Chop: { φ ψ }} { b m e } {{ } φ } {{ } ψ for some m : b m e In DC: Intv = { [a, b] a, b R a b} 30 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
31 Duration Calculus - Zhou Hoare Ravn 91 Extends Interval Temporal Logic as follows: State variables P : Time {0, 1} Finite Variability State expressions S ::= 0 1 P S S 1 S 2 S : Time {0, 1} pointwise defined Durations S : Intv R defined on [b, e] by e b S(t)dt Temporal variables with a structure 31 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
32 Duration Calculus - Zhou Hoare Ravn 91 Extends Interval Temporal Logic as follows: State variables P : Time {0, 1} Finite Variability State expressions S ::= 0 1 P S S 1 S 2 S : Time {0, 1} pointwise defined Durations S : Intv R defined on [b, e] by e b S(t)dt Temporal variables with a structure 32 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
33 Duration Calculus - Zhou Hoare Ravn 91 Extends Interval Temporal Logic as follows: State variables P : Time {0, 1} Finite Variability State expressions S ::= 0 1 P S S 1 S 2 S : Time {0, 1} pointwise defined Durations S : Intv R defined on [b, e] by e b S(t)dt Temporal variables with a structure 33 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
34 Example: Gas Burner Requirement Design decisions l L l D 1 ˆ= ( L l 1) D 2 ˆ= (( L L L ) l 30) where l denotes the length of the interval, and φ ˆ= true φ true for some sub-interval: φ φ ˆ= φ for all sub-intervals: φ P ˆ= P = l l > 0 P holds throughout a non-point interval succinct formulation no interval endpoints 34 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
35 Example: Gas Burner Requirement Design decisions l L l D 1 ˆ= ( L l 1) D 2 ˆ= (( L L L ) l 30) where l denotes the length of the interval, and φ ˆ= true φ true for some sub-interval: φ φ ˆ= φ for all sub-intervals: φ P ˆ= P = l l > 0 P holds throughout a non-point interval succinct formulation no interval endpoints 35 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
36 Example: Gas Burner Requirement Design decisions l L l D 1 ˆ= ( L l 1) D 2 ˆ= (( L L L ) l 30) where l denotes the length of the interval, and φ ˆ= true φ true for some sub-interval: φ φ ˆ= φ for all sub-intervals: φ P ˆ= P = l l > 0 P holds throughout a non-point interval succinct formulation no interval endpoints 36 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010
Duration Calculus Introduction
Duration Calculus Introduction Michael R. Hansen mrh@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 02240 Computability and Semantics, Spring 05, c Michael R. Hansen
Declarative modelling for timing
Declarative modelling for timing The real-time logic: Duration Calculus Michael R. Hansen mrh@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 02153 Declarative Modelling,
A Theory of Duration Calculus with Application
A Theory of Duration Calculus with Application Michael R. Hansen 1 and Dang Van Hung 2 1 Informatics and Math. Modelling, Technical University of Denmark Ricard Petersens Plads, DK-2800 Lyngby, Denmark
Moby/RT: A Tool for Specification and Verification of Real-Time Systems
Moby/RT: A Tool for Specification and Verification of Real-Time Systems Ernst-Rüdiger Olderog (Department of Computing Science University of Oldenburg olderog@informatik.uni-oldenburg.de) Henning Dierks
Non-elementary Lower Bound for Propositional Duration. Calculus. A. Rabinovich. Department of Computer Science. Tel Aviv University
Non-elementary Lower Bound for Propositional Duration Calculus A. Rabinovich Department of Computer Science Tel Aviv University Tel Aviv 69978, Israel 1 Introduction The Duration Calculus (DC) [5] is a
A Duration Calculus with Infinite Intervals
A Duration Calculus with Infinite Intervals Zhou Chaochen, Dang Van Hung, and Li Xiaoshan The United Nations University International Institute for Software Technology UNU/IIST, P.O.Box 3058, Macau e-mail:
A Duration Calculus Semantics. for. Real-Time Reactive Systems. Michael R. Hansen. Ernst-Rudiger Olderog. Michael Schenke.
A Duration Calculus Semantics for Real-Time Reactive Systems Michael R. Hansen Ernst-Rudiger Olderog Michael Schenke Martin Franzle Markus Muller-Olm Burghard von Karger Hans Rischel Date: 17 August 1993
An Algebraic Semantics for Duration Calculus
An Algebraic Semantics for Duration Calculus Peter Höfner Institut für Informatik, Universität Augsburg D-86135 Augsburg, Germany hoefner@informatik.uni-augsburg.de Abstract. We present an algebraic semantics
In a second part, we concentrate on interval models similar to the traditional ITL models presented in [, 5]. By making various assumptions about time
![In a second part, we concentrate on interval models similar to the traditional ITL models presented in [, 5]. By making various assumptions about time](/thumbs/81/84326052.jpg "In a second part, we concentrate on interval models similar to the traditional ITL models presented in [, 5]. By making various assumptions about time")
Complete Proof Systems for First Order Interval Temporal Logic Bruno Dutertre Department of Computer Science Royal Holloway, University of London Egham, Surrey TW0 0EX, United Kingdom Abstract Dierent
Verification 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
Model 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
Lecture 05: Duration Calculus III
Real-Time Systems Lecture 05: Duration Calculus III 2014-05-20 Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: DC Syntax and Semantics: Formulae This Lecture:
Lecture 03: Duration Calculus I
Real-Time Systems Lecture 03: Duration Calculus I 2014-05-08 Dr. Bernd Westphal 03 2014-05-08 main Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: Model of timed behaviour:
A Higher-Order Duration Calculus and Its Completeness 1
A Higher-Order Duration Calculus and Its Completeness 1 Zhan Naijun Lab. of Computer Science and Technology, Institute of Software, the Chinese Academy of Sciences, Beijing, 100080, P.R. China Email: znj@ox.ios.ac.cn
Linking Duration Calculus and TLA
Linking Duration Calculus and TLA Yifeng Chen and Zhiming Liu Department of Computer Science, University of Leicester, Leicester LE1 7RH, UK Email: {Y.Chen, Z.Liu}@mcs.le.ac.uk Abstract. Different temporal
Probabilistic Duration Calculus for Continuous Time
Formal Aspects of Computing (22) 3: 1 24 c 22 BCS Probabilistic Duration Calculus for Continuous Time Dang Van Hung 1 and Zhou Chaochen 2 The United Nations University International Institute for Software
From Duration Calculus. (Extended Abstract) zu Kiel, Preuerstr. 1-9, D Kiel, Germany.
From Duration Calculus To Linear Hybrid Automata? (Extended Abstract) Ahmed Bouajjani 1???, Yassine Lakhnech 2??, and Riadh Robbana 1??? 1 VERIMAG, Miniparc-Zirst, Rue Lavoisier 38330 Montbonnot St-Martin,
Synthesising Controllers from Real-Time Specifications
Synthesising Controllers from Real-Time Specifications Henning Dierks University of Oldenburg Department of Computer Science P.O.Box 253, D-26111 Oldenburg, Germany dierks@informatik.uni-oldenburg.de Abstract
Probabilistic Neighbourhood Logic
Probabilistic Neighbourhood Logic Dimitar P. Guelev International Institute for Software Technology of the United Nations University (UNU/IIST), Macau, P.O.Box 3058. E-mail: dg@iist.unu.edu Abstract. This
REAL-TIME control systems usually consist of some
1 A Formal Design Technique for Real-Time Embedded Systems Development using Duration Calculus François Siewe, Dang Van Hung, Hussein Zedan and Antonio Cau Abstract In this paper we present a syntactical
Projections: A Technique for Verifying Real-Time Programs in Duration Calculus
Projections: A Technique for Verifying Real-Time Programs in Duration Calculus Dang Van Hung The United Nations University International Institute for Software Technology P.O.Box 3058, Macau Abstract.
A Mixed Decision Method for Duration Calculus
A Mixed Decision Method for Duration Calculus NATHALIE CHETCUTI-SERANDIO and LUIS FARIÑAS DEL CERRO, Institut de Recherche en Informatique de Toulouse, 118, route de Narbonne, F-31062 Toulouse cedex 04,
Duration Calculus of Weakly Monotonic Time
Duration Calculus of Weakly Monotonic Time Paritosh K. Pandya 1 and Dang Van Hung 2 1 Tata Institute of Fundamental Research Mumbai 400 005, India email: pandya@tcs.tifr.res.in 2 UNU/IIST Macau email:
Operational and Logical Semantics. for Polling Real-Time Systems? Vaandrager 1. Abstract. PLC-Automata are a class of real-time automata suitable
Operational and Logical Semantics for Polling Real-Time Systems? Henning Dierks 2;??, Ansgar Fehnker 1;???, Angelika Mader 1;y, and Frits Vaandrager 1 1 Computing Science Institute, University of Nijmegen,
Metric Propositional Neighborhood Logics
Metric Propositional Neighborhood Logics D. Bresolin, D. Della Monica, V. Goranko, A. Montanari, and G. Sciavicco University of Murcia guido@um.es Please notice: these slides have been mostly produced
Computing Accumulated Delays in Real-time Systems
Computing Accumulated Delays in Real-time Systems P~jeev Alur 1, Costas Courcoubetis u *, Thomas A. Henzinger 3 ** i AT&T Bell Laboratories, Murray Hill 2 Department of Computer Science, University of
Recent 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.
Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders
Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders Davide Bresolin 1, Angelo Montanari 2, Pietro Sala 1, and Guido Sciavicco 34 1 Department of Computer
Timed 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.
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable SynCop 2014 1st International Workshop on Synthesis of Continuous Parameters Karin Quaas University of Leipzig 6th April 2014 Outline
Deciding Continuous-time Metric Temporal Logic with Counting Modalities
Deciding Continuous-time Metric Temporal Logic with Counting Modalities RP 2013 Marcello M. Bersani Matteo Rossi Pierluigi San Pietro - Politecnico di Milano Motivations Con+nuous +me is o%en used for
An Algorithmic Approach to the Specication and Verication of. Abstract
Hybrid Automata: An Algorithmic Approach to the Specication and Verication of Hybrid Systems 1 Rajeev Alur 2 Costas Courcoubetis 3 Thomas A. Henzinger 4 Pei-Hsin Ho 3 Abstract We introduce the framework
Models 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
PLC-automata: a new class of implementable real-time automata
Theoretical Computer Science 253 (2001) 61 93 www.elsevier.com/locate/tcs PLC-automata: a new class of implementable real-time automata Henning Dierks 1 University of Oldenburg, Fachbereich Informatik,
The specication of reactive and real-time systems must be supported by formal, mathematicallyfounded
Temporal Logics for Real-Time System Specication P. Bellini, R. Mattolini, P. Nesi Department of Systems and Informatics, University of Florence Via S. Marta 3, 50139 Firenze, Italy, tel.: +39-055-4796523,
we could choose to work with the following symbols for natural numbers: Syntax: zero,one,two,...,twentyseven,...
3 27--26 main 27--7 Snoncontent 2 27--9 Sdcpreview 3 27--26 Scontent Content Real- Systems Lecture 3: Duration Calculus I 27--26 Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Symbols
Formal Fault Tree Semantics
Integrated Design and Process Technology, IDPT-2002 Printed in the United States of America, June, 2002 c 2002 Society for Desing and Process Science Formal Fault Tree Semantics Gerhard Schellhorn, Andreas
On 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
Lecture 3: Duration Calculus I
Real-Time Systems Lecture 3: Duration Calculus I 27--26 Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany 3 27--26 main Content Introduction Observables and Evolutions Duration Calculus (DC)
The Expressive Completeness of Metric Temporal Logic
The Expressive Completeness of Metric Temporal Logic Paul Hunter Université Libre de Bruxelles Highlights of Logic, Games and Automata September 2013 Reasoning about time LTL has emerged as the definitive
An optimal tableau-based decision algorithm for Propositional Neighborhood Logic
An optimal tableau-based decision algorithm for Propositional Neighborhood Logic Davide Bresolin, Angelo Montanari, and Pietro Sala Department of Mathematics and Computer Science, University of Udine,
The Representability of Partial Recursive Functions in Arithmetical Theories and Categories
The Representability of Partial in Arithmetical Theories and Categories Department of Mathematics and Statistics University of Ottawa Foundational Methods in Computer Science May 30 June 2, 2018 First-order
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
A Temporal Dynamic Logic for Verifying Hybrid System Invariants André Platzer University of Oldenburg, Department of Computing Science, Germany Carnegie Mellon University, Computer Science Department,
Formal Development of a Feedback Control System with Fault. Department of Automatic Control, Abstract
Formal Development of a Feedback Control System with Fault Accomodation æ Gao Jianping y, Chen Zongji z Department of Automatic Control, Beijing University of Aeronautics and Astronautics, Beijing, 100083,
Real-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
What Good Are Digital Clocks? y. Abstract. Real-time systems operate in \real," continuous time
What Good Are Digital Clocks? y Thomas A. Henzinger z Zohar Manna x Amir Pnueli { Abstract. Real-time systems operate in \real," continuous time and state changes may occur at any real-numbered time point.
Combining Real-Time Model-Checking and Fault Tree Analysis
Combining Real-Time Model-Checking and Fault Tree Analysis Andreas Schäfer Department of Computing Science, University of Oldenburg, 26111 Oldenburg, Germany schaefer@informatik.uni-oldenburg.de Abstract.
Formal Models of Timed Musical Processes Doctoral Defense
Formal Models of Timed Musical Processes Doctoral Defense Gerardo M. Sarria M. Advisor: Camilo Rueda Co-Advisor: Juan Francisco Diaz Universidad del Valle AVISPA Research Group September 22, 2008 Motivation
Interactive Verification of Concurrent Systems using Symbolic Execution
Interactive Verification of Concurrent Systems using Symbolic Execution Michael Balser, Simon Bäumler, Wolfgang Reif, and Gerhard Schellhorn University of Augsburg, Germany Abstract This paper presents
overview overview proof system for basic modal logic proof systems advanced logic lecture 8 temporal logic using temporal frames
overview advanced logic 2018 02 28 lecture 8 proof systems temporal logic using temporal frames overview proof system for basic modal logic extension: φ if φ is a tautology from prop1 proof systems temporal
Bounded Model-checking of Discrete Duration Calculus
Bounded Model-checking of Discrete Duration Calculus Quan Zu and Miaomiao Zhang School of Software Engineering Tongji University Shanghai, China {7quanzu,miaomiao}@tongji.edu.cn Jiaqi Zhu and Naijun Zhan
Diagram-based Formalisms for the Verication of. Reactive Systems. Anca Browne, Luca de Alfaro, Zohar Manna, Henny B. Sipma and Tomas E.
In CADE-1 Workshop on Visual Reasoning, New Brunswick, NJ, July 1996. Diagram-based Formalisms for the Verication of Reactive Systems Anca Browne, Luca de Alfaro, Zohar Manna, Henny B. Sipma and Tomas
Introduction to Turing Machines
Introduction to Turing Machines Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 12 November 2015 Outline 1 Turing Machines 2 Formal definitions 3 Computability
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable Matthias Horbach, Marco Voigt, Christoph Weidenbach To cite this version: Matthias Horbach, Marco Voigt,
Logic Part II: Intuitionistic Logic and Natural Deduction
Yesterday Remember yesterday? classical logic: reasoning about truth of formulas propositional logic: atomic sentences, composed by connectives validity and satisability can be decided by truth tables
Logic in Computer Science. Frank Wolter
Logic in Computer Science Frank Wolter Meta Information Slides, exercises, and other relevant information are available at: http://www.liv.ac.uk/~frank/teaching/comp118/comp118.html The module has 18 lectures.
Lecture 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:
The 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
PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2
PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,
Serge 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
Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic
Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic Angelo Brillout, 1 Daniel Kroening, 2 Philipp Rümmer, 3 Thomas Wahl 2 1 ETH Zurich 2 Oxford University 3 Uppsala University Deduction
Logic and Compositional Verification of Hybrid Systems
Logic and Compositional Verification of Hybrid Systems (Invited Tutorial) André Platzer Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA aplatzer@cs.cmu.edu Abstract. Hybrid
THEORY OF SYSTEMS MODELING AND ANALYSIS. Henny Sipma Stanford University. Master class Washington University at St Louis November 16, 2006
THEORY OF SYSTEMS MODELING AND ANALYSIS Henny Sipma Stanford University Master class Washington University at St Louis November 16, 2006 1 1 COURSE OUTLINE 8:37-10:00 Introduction -- Computational model
Real-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:
Linear Temporal Logic and Büchi Automata
Linear Temporal Logic and Büchi Automata Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 Yih-Kuen Tsay (SVVRL @ IM.NTU) Linear Temporal Logic and Büchi Automata
Undecidability and temporal logic: some landmarks from Turing to the present
Undecidability and temporal logic: some landmarks from Turing to the present Technical University of Denmark Leicester, September 12-14, 2012 Outline Introduction: a brief retrospective. Turing s undecidability
Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic
Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic Angelo Brillout 1, Daniel Kroening 2, Philipp Rümmer 2, and Thomas Wahl 2 1 ETH Zurich, Switzerland 2 Oxford University Computing
The Expressiveness of Metric Temporal Logic II:
The Expressiveness of Metric Temporal Logic II: This time it s irrational! Paul Hunter Université Libre de Bruxelles (Joint work with Joël Ouaknine and James Worrell) Université Libre de Bruxelles, March
7. 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,
Lecture 9: DC Implementables II
Real-Time Systems Lecture 9: DC Implementables II 2017-11-28 Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany 9 2017-11-28 main Content Correctness Proof for the Gas Burner Implementables
Guest lecturer: Prof. Mark Reynolds. School of Computer Science and Software Engineering 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 04: Continuous Temporal Logics Guest lecturer:
The Cost of Punctuality
The Cost of Punctuality Patricia Bouyer 1,2 Nicolas Markey 1 Joël Ouaknine 2 James Worrell 2 1 LSV, CNRS & ENS Cachan, France 2 Oxford University, UK {bouyer,markey}@lsv.ens-cachan.fr {joel,jbw}@comlab.ox.ac.uk
AVACS Automatic Verification and Analysis of Complex Systems REPORTS. of SFB/TR 14 AVACS. Editors: Board of SFB/TR 14 AVACS
AVACS Automatic Verification and Analysis of Complex Systems REPORTS of SFB/TR 14 AVACS Editors: Board of SFB/TR 14 AVACS Differential Dynamic Logic for Verifying Parametric Hybrid Systems by André Platzer
Overview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading
Course staff CS389L: Automated Logical Reasoning Lecture 1: ntroduction and Review of Basics şıl Dillig nstructor: şil Dillig E-mail: isil@cs.utexas.edu Office hours: Thursday after class until 6:30 pm
UNU/IIST. International Institute for Software Technology
UNU/IIST International Institute for Software Technology A Technique for Improvement of Modelchecking Linear Duration Invariants Dangaasuren Garmaa and Dang Van Hung March 2000 UNU/IIST Report No. 191
Predicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. Motivation 1. Variables, quantifiers and predicates 2. Syntax 1. Terms and formulas 2. Quantifiers, scope
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders Davide Bresolin 1, Angelo Montanari 2, Pietro Sala 2, and Guido Sciavicco 3 1 Department of Computer Science, University of
Advances in Parametric Real-Time Reasoning
Advances in Parametric Real-Time Reasoning Daniel Bundala and Joël Ouaknine Department of Computer Science, University of Oxford Wolfson Building, Parks Road, Oxford, OX1 3QD, UK Abstract. We study the
Mediated Population Protocols
Othon Michail Paul Spirakis Ioannis Chatzigiannakis Research Academic Computer Technology Institute (RACTI) July 2009 Michail, Spirakis, Chatzigiannakis 1 / 25 Outline I Population Protocols 1 Population
A Decidable Logic for Complex Contracts
A Decidable Logic for Complex Contracts Cristian Prisacariu joint work with Gerardo Schneider Precise Modeling and Analysis group (PMA), University of Oslo 21 st Nordic Workshop on Programming Theory (NWPT'09)
CS256/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
Synthesis of Asynchronous Systems
Synthesis of Asynchronous Systems Sven Schewe and Bernd Finkbeiner Universität des Saarlandes, 66123 Saarbrücken, Germany {schewe finkbeiner}@cs.uni-sb.de Abstract. This paper addresses the problem of
Strategy Logic. 1 Introduction. Krishnendu Chatterjee 1, Thomas A. Henzinger 1,2, and Nir Piterman 2
Strategy Logic Krishnendu Chatterjee 1, Thomas A. Henzinger 1,2, and Nir Piterman 2 1 University of California, Berkeley, USA 2 EPFL, Switzerland c krish@eecs.berkeley.edu, {tah,nir.piterman}@epfl.ch Abstract.
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial *
Formal Methods in System Design, 16, 1 45 (2000) c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Verifying Temporal Properties of Reactive Systems: A STeP Tutorial * NIKOLAJ
Modal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
Nonclassical logics (Nichtklassische Logiken)
Nonclassical logics (Nichtklassische Logiken) VU 185.249 (lecture + exercises) http://www.logic.at/lvas/ncl/ Chris Fermüller Technische Universität Wien www.logic.at/people/chrisf/ chrisf@logic.at Winter
Propositional and Predicate Logic - XIII
Propositional and Predicate Logic - XIII Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - XIII WS 2016/2017 1 / 22 Undecidability Introduction Recursive
Performance Evaluation of Censoring-Enabled Systems for Sequential Detection in Large Wireless Sensor Networks
Performance Evaluation of Censoring-Enabled Systems for Sequential Detection in Large Wireless Sensor Networks Mohammed Karmoose Karim Seddik 2 Ahmed Sultan Electrical Engineering Dept, Alexandria University
Theory of Computation
Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation / Lecture 3: Overview Decidability of Logical Theories Presburger arithmetic Decidability of Presburger Arithmetic Dr.
Requirements Validation for Hybrid Systems
Requirements Validation for Hybrid Systems Alessandro Cimatti, Marco Roveri, and Stefano Tonetta Fondazione Bruno Kessler (FBK-irst), Trento, Italy Abstract. The importance of requirements for the whole
Realizability of Real-Time Logics
Realizability of Real-Time Logics L. Doyen 1, G. Geeraerts 1, J.-F. Raskin 1, and J. Reichert 2 1 Département d Informatique, Université Libre de Bruxelles (U.L.B.) 2 École Normale Supérieure de Cachan
Semi-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
An Introduction to Temporal Logics
An Introduction to Temporal Logics c 2001,2004 M. Lawford Outline Motivation: Dining Philosophers Safety, Liveness, Fairness & Justice Kripke structures, LTS, SELTS, and Paths Linear Temporal Logic Branching
As 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
Verifying Concurrent Systems with Symbolic Execution
Verifying Concurrent Systems with Symbolic Execution MICHAEL BALSER, CHRISTOPH DUELLI, WOLFGANG REIF and GERHARD SCHELLHORN, Lehrstuhl Softwaretechnik und Programmiersprachen, Universität Augsburg, D-86135
arxiv:cs/ v2 [cs.lo] 24 Apr 2005
![arxiv:cs/ v2 [cs.lo] 24 Apr 2005](/thumbs/73/69292743.jpg "arxiv:cs/ v2 [cs.lo] 24 Apr 2005")
SIGACT News Logic Column 11 The Finite and the Infinite in Temporal Logic arxiv:cs/0502031v2 [cs.lo] 24 Apr 2005 Riccardo Pucella Cornell University Ithaca, NY 14853 USA riccardo@cs.cornell.edu Note from
PROOFS IN PREDICATE LOGIC AND COMPLETENESS; WHAT DECIDABILITY MEANS HUTH AND RYAN 2.3, SUPPLEMENTARY NOTES 2
PROOFS IN PREDICATE LOGIC AND COMPLETENESS; WHAT DECIDABILITY MEANS HUTH AND RYAN 2.3, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 12 September, 2005 Some slides today new, some based on logic 2004 (Nils
A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic (RPNL )
A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic (RPNL ) Davide Bresolin Angelo Montanari Dipartimento di Matematica e Informatica Università degli Studi di Udine {bresolin,
Propositions as Types
Propositions as Types Martin Pfeifhofer & Felix Schett May 25, 2016 Contents 1 Introduction 2 2 Content 3 2.1 Getting Started............................ 3 2.2 Effective Computability And The Various Definitions.......
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma