LTL: Linear-time logic. LTL is another important temporal logic. In LTL the future is seen as a sequence of states, so the future is seen as a path.
|
|
- Elisabeth McDonald
- 7 years ago
- Views:
Transcription
1 LTL: Linear-time logic LTL is another imortant temoral logic. In LTL the future is seen as a sequence of states, so the future is seen as a ath. We can consider a set of aths, however we don t have an existential ath quantifier (the E of CTL), when we interret an LTL formula over a set of aths the formula has to be true of all aths to be true, i.e we are always quantifying universally over all ossible aths in the set. 1
2 In LTL roositions are interreted not over trees (like CTL does) but over individual aths, As usual there are atomic roosition 1,..., n,... Other formulas are as follows: φ ::= true false φ 1 φ 2 φ 1 φ 2 φ φ φ Gφ Fφ Xφ [φuφ] [φwφ] [φrφ] So we are missing few CTL oerators (the temoral modalities) and adding two new: W, R whose meaning is Weak until and Release 2
3 Regarding the absence of ath quantifiers A and E. We said that this is because a formula is evaluated on a ath, or a set of aths A set of aths satisfy φ iff every ath in the set satisfy φ. That mean that imlicitly all formulas are universally ath quantified, i.e. [Uq] stands for A[Uq] etc... 3
4 We don t have ath quantifiers, so we know we can t write things like E ( U q) or E F or A G E F however there are things we can write in LTL that we couldn t write in CTL. Consider F Fq and comare it to his closest CTL relative: AF AFq 4
5 There are things we can write in CTL but not in LTL, things like on all aths is always true that exists a ath such that... There are things we can write in LTL but not in CTL, like If it is infinitely often the case that then at some oint q A G E G G F Fq... q 5
6 Remember that in CTL the semantics was defined as a relation K, s = φ where s is a state in the KTS LTL semantics will be defined as a relation K, π = φ where π is a ath in the KTS. we will note aths as follows: π = s 0 s 1... s n and π i = s i... s n i.e. π i is the subath of π starting at s i. 6
7 Let s see how to give a semantics to LTL. We consider the same structure we used for the semantics of CTL, i.e. a KTS K=(S,,I) Given a KTS K, we are going to define the relation K, π = φ meaning the ath π in K satisfies the formula φ. The definition is by induction on the structure of φ 8
8 K, π = true K, π = false K, π = iff I(s 0 ) K, π = φ iff K, π = φ K, π = φ 1 φ 2 iff K, π = φ 1 and K, π = φ 2 K, π = φ 1 φ 2 iff K, π = φ 1 or K, π = φ 2 K, π = φ 1 φ 2 iff K, π = φ 1 or K, π = φ 2 K, π = Gφ iff for all aths π i for all i 0 we have K, π i = φ K, π = Fφ iff for some ath π i for some i 0 we have K, π i = φ 9
9 K, π = Xφ iff K, π 1 = φ K, π = [φ 1 Uφ 2 ] iff exists i 0 such that K, π i = φ 2 and for all j < i, K, π j = φ 1 K, π = [φ 1 Wφ 2 ] iff exists i 0 such that K, π i = φ 2 and for all j < i, K, π j = φ 1 or for all i 0 K, π i = φ 1 K, π = [φ 1 Rφ 2 ] iff exists i 0 such that K, π i = φ 1 and for all j i, K, π j = φ 2 or for all i 0 K, π i = φ 2
10 Notes: [φ 1 Wφ 2 ] is the same as [φ 1 Uφ 2 ] Gφ 1 [φ 1 Rφ 2 ] is the same as [ φ 1 U φ 2 ] q Until q q Weak Until q q q Releases q 10
11 Few words about aths: Strictly seaking, given a KTS and a state, the aths starting at that state s are all sequences of states starting from s such that if s is in the ath and s s is a transition in the KTS then s is in the ath as well. So the aths (starting at s 0 ) in s0, q q s2 s1 are the sequences of the form (s 0 s 1 ) n s 0 s 2 where n 0 11
12 Most authors require aths in LTL to be infinite; as such our revious KTS would have no ath. However is easily seen that we can always transform finite aths into infinite ones by adding loos on the ending states. Here is what our revious KTS would become s0,q s2 q s1 Hence to kee things simle we don t require aths to be infinite. Also we may want sometimes to use finite refixes of aths: 12
13 In the KTS just seen and starting at s 0 we have s 0 s 2, s 0 s 1 s 0 s 1 s 0. (s 0 s 1 ) n s 0 (s 0 s 1 ) n s 0 s 2 (s 0 s 1 ) n s 0 s 1 You should read the aths ending with s 0 and s 1 as finite refixes of aths as you could always extend a ath ending with s 0 with an s 2 and one ending with s 1 with s 0 s 2 13
14 Here we use finite refixes to illustrate the meaning of LTL formulas: (s 0 s 1 ) n s 0 = Gq, (s 0 s 1 ) n s 0 = Fq, (s 0 s 1 ) n s 0 = GFq (s 0 s 1 ) n s 0 s 1 = G, s 0 s 2 = Gq but {(s 0 s 1 ) n s 0 s 1, s 0 s 2 } = G Gq but {(s 0 s 1 ) n s 0 s 1, s 0 s 2 } = G Gq (s 0 s 1 ) n s 0 = (Uq) what about (s 0 s 1 ) n s 0 s 1 = (qr)? 14
15 Few equivalences of LTL formulas: Gφ F φ Fφ G φ Xφ X φ (φuψ) φr ψ φuψ (φwψ) Fψ Fφ true Uφ Gφ false Rφ 15
16 What we can exress with LTL formulas? Over the years few classes of roerties of systems have emerged as suitable to be studied by these temoral logics: what kind of roerties make sense for all ossible systems modeled by KTS? Things like the ower is on, there is enough fuel etc... are not general roerties but the following are: 16
17 a Reachability : A articular state is reachable from the resent state b Safety: A (bad) roerty will never be satisfied c Liveness: A (good) roerty will always be satisfied by some state in the future c Deadlock freedom: never be reached a dead end state will 17
18 Safety is to rule out bad (catastrohic) behaviours of the system. For examle in a vending machine an examle of safety is: a state where a drink is given with no money inserted is never met Some more examles: A missile is never launched unless the launch button is ressed A traffic light is not green if its orthogonal light is green A train will not cross a train crossing with the gates in the u osition 18
19 Liveness is to ensure that the system does what is is meant to do. Examle of liveness: If enough money is in the machine a drink will be released if the launch button is ressed the missile will be launched If the light is orange then it will become red next If the train is aroaching the crossing the gates will go down
20 So a live and safe system is a system which does what is meant to do and doesn t do things it is not meant to do. That should ensure that the system is well-behaving, shouldn t it? Consider two traffic light in a junction satisfying the liveness and safety conditions described above. Would that be roerly working? 19
21 Solution: Have you ever been at a red traffic light waiting for the light to become green, and waiting... and waiting... You can have systems where comonents are waiting forever for some other comonent to finish. If A is waiting for B who is waiting for A you have a deadlock. If A is waiting for B, B is roerly working but it never gets back to A you have un-fairness 20
22 In KTS terms deadlock means that the system has reached a state s which has no successor (i.e. there is no outgoing transition out of s). Informally fairness means that a state that is available infinitely often will eventually be reached, for examle at a junction if it is ossible to turn left then at some oint some car will turn left. Roughly seaking most systems which are safe, live, deadlock free and fair are systems working roerly 21
Software Model Checking: Theory and Practice
Software Model Checking: Theory and Practice Lecture: Secification Checking - Temoral Logic Coyright 2004, Matt Dwyer, John Hatcliff, and Robby. The syllabus and all lectures for this course are coyrighted
More informationSoftware Modeling and Verification
Software Modeling and Verification Alessandro Aldini DiSBeF - Sezione STI University of Urbino Carlo Bo Italy 3-4 February 2015 Algorithmic verification Correctness problem Is the software/hardware system
More informationSoftware Verification and Testing. Lecture Notes: Temporal Logics
Software Verification and Testing Lecture Notes: Temporal Logics Motivation traditional programs (whether terminating or non-terminating) can be modelled as relations are analysed wrt their input/output
More information1 Gambler s Ruin Problem
Coyright c 2009 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationTemporal Logics. Computation Tree Logic
Temporal Logics CTL: definition, relationship between operators, adequate sets, specifying properties, safety/liveness/fairness Modeling: sequential, concurrent systems; maximum parallelism/interleaving
More informationFixed-Point Logics and Computation
1 Fixed-Point Logics and Computation Symposium on the Unusual Effectiveness of Logic in Computer Science University of Cambridge 2 Mathematical Logic Mathematical logic seeks to formalise the process of
More informationIntroduction to Software Verification
Introduction to Software Verification Orna Grumberg Lectures Material winter 2013-14 Lecture 4 5.11.13 Model Checking Automated formal verification: A different approach to formal verification Model Checking
More informationFormal Verification and Linear-time Model Checking
Formal Verification and Linear-time Model Checking Paul Jackson University of Edinburgh Automated Reasoning 21st and 24th October 2013 Why Automated Reasoning? Intellectually stimulating and challenging
More informationDevelopment of dynamically evolving and self-adaptive software. 1. Background
Development of dynamically evolving and self-adaptive software 1. Background LASER 2013 Isola d Elba, September 2013 Carlo Ghezzi Politecnico di Milano Deep-SE Group @ DEIB 1 Requirements Functional requirements
More informationTraditional Software Development. Model Requirements and JAVA Programs. Formal Verification & Validation. What is a state?
Mel Requirements and JAVA Programs MVP The Waterfall Mel Problem Area Traditional Software Develoment Analysis REVIEWS Design Costly wrt time and money. Errors are found too late (or maybe never). SPIN/PROMELA
More informationAlgorithmic Software Verification
Algorithmic Software Verification (LTL Model Checking) Azadeh Farzan What is Verification Anyway? Proving (in a formal way) that program satisfies a specification written in a logical language. Formal
More informationIntroduction to NP-Completeness Written and copyright c by Jie Wang 1
91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use time-bounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of
More informationModel Checking LTL Properties over C Programs with Bounded Traces
Noname manuscript No. (will be inserted by the editor) Model Checking LTL Properties over C Programs with Bounded Traces Jeremy Morse 1, Lucas Cordeiro 2, Denis Nicole 1, Bernd Fischer 1,3 1 Electronics
More informationModels, Formulas and the LTL Model Cheating
Helsini University of Technology Laboratory for Theoretical Comuter Science Research Reorts 92 Tenillisen oreaoulun tietojenäsittelyteorian laboratorion tutimusraortti 92 Esoo 24 HUT-TCS-A92 SIMPLE BOUNDED
More informationOverview of Lecture 3. Model Checking with SPIN. First attempt (revisited) Linear Temporal Logic (LTL) CDP #3
Concurrent and Distributed Programming htt://fmt.cs.utwente.nl/courses/cd/ Mel Checking with SPIN CDP #3 Overview of Lecture 3 Ch. 4 - Verification of Concurrent Programs linear temoral logic (LTL) deductive
More informationToday s Agenda. Automata and Logic. Quiz 4 Temporal Logic. Introduction Buchi Automata Linear Time Logic Summary
Today s Agenda Quiz 4 Temporal Logic Formal Methods in Software Engineering 1 Automata and Logic Introduction Buchi Automata Linear Time Logic Summary Formal Methods in Software Engineering 2 1 Buchi Automata
More informationCISC422/853: Formal Methods
Outline CISC422/853: Formal Methods in Software Engineering: Computer-Aided Verification Topic 7: Specifying, or How to Describe How the System Should (or Should Not) Behave Juergen Dingel Feb, 2009 Readings:
More informationModel checking test models. Author: Kevin de Berk Supervisors: Prof. dr. Wan Fokkink, dr. ir. Machiel van der Bijl
Model checking test models Author: Kevin de Berk Supervisors: Prof. dr. Wan Fokkink, dr. ir. Machiel van der Bijl February 14, 2014 Abstract This thesis is about model checking testing models. These testing
More informationlogic language, static/dynamic models SAT solvers Verified Software Systems 1 How can we model check of a program or system?
5. LTL, CTL Last part: Alloy logic language, static/dynamic models SAT solvers Today: Temporal Logic (LTL, CTL) Verified Software Systems 1 Overview How can we model check of a program or system? Modeling
More informationT-79.186 Reactive Systems: Introduction and Finite State Automata
T-79.186 Reactive Systems: Introduction and Finite State Automata Timo Latvala 14.1.2004 Reactive Systems: Introduction and Finite State Automata 1-1 Reactive Systems Reactive systems are a class of software
More informationAutomata-based Verification - I
CS3172: Advanced Algorithms Automata-based Verification - I Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2006 Supporting and Background Material Copies of key slides (already
More informationIndex Numbers OPTIONAL - II Mathematics for Commerce, Economics and Business INDEX NUMBERS
Index Numbers OPTIONAL - II 38 INDEX NUMBERS Of the imortant statistical devices and techniques, Index Numbers have today become one of the most widely used for judging the ulse of economy, although in
More informationAn important observation in supply chain management, known as the bullwhip effect,
Quantifying the Bullwhi Effect in a Simle Suly Chain: The Imact of Forecasting, Lead Times, and Information Frank Chen Zvi Drezner Jennifer K. Ryan David Simchi-Levi Decision Sciences Deartment, National
More informationModel Checking II Temporal Logic Model Checking
1/32 Model Checking II Temporal Logic Model Checking Edmund M Clarke, Jr School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 2/32 Temporal Logic Model Checking Specification Language:
More information6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks
6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In
More informationAutomated Route Planning for Milk-Run Transport Logistics with the NuSMV Model Checker
IEICE TRANS. INF. & SYST., VOL.E96 D, NO.12 DECEMBER 2013 2555 PAPER Special Section on Parallel and Distributed Computing and Networking Automated Route Planning for Milk-Run Transport Logistics with
More informationA CTL-Based Logic for Program Abstractions
A CTL-Based Logic for Program Abstractions Martin Lange 1 and Markus Latte 2 1 Dept. of Computer Science, University of Kassel, Germany 2 Dept. of Computer Science, Ludwig-Maximilians-University Munich,
More informationThe fundamental question in economics is 2. Consumer Preferences
A Theory of Consumer Behavior Preliminaries 1. Introduction The fundamental question in economics is 2. Consumer Preferences Given limited resources, how are goods and service allocated? 1 3. Indifference
More informationFormal Verification by Model Checking
Formal Verification by Model Checking Natasha Sharygina Carnegie Mellon University Guest Lectures at the Analysis of Software Artifacts Class, Spring 2005 1 Outline Lecture 1: Overview of Model Checking
More informationModel Checking: An Introduction
Announcements Model Checking: An Introduction Meeting 2 Office hours M 1:30pm-2:30pm W 5:30pm-6:30pm (after class) and by appointment ECOT 621 Moodle problems? Fundamentals of Programming Languages CSCI
More informationStability Improvements of Robot Control by Periodic Variation of the Gain Parameters
Proceedings of the th World Congress in Mechanism and Machine Science ril ~4, 4, ianin, China China Machinery Press, edited by ian Huang. 86-8 Stability Imrovements of Robot Control by Periodic Variation
More informationStat 134 Fall 2011: Gambler s ruin
Stat 134 Fall 2011: Gambler s ruin Michael Lugo Setember 12, 2011 In class today I talked about the roblem of gambler s ruin but there wasn t enough time to do it roerly. I fear I may have confused some
More informationMore Properties of Limits: Order of Operations
math 30 day 5: calculating its 6 More Proerties of Limits: Order of Oerations THEOREM 45 (Order of Oerations, Continued) Assume that!a f () L and that m and n are ositive integers Then 5 (Power)!a [ f
More informationC-Bus Voltage Calculation
D E S I G N E R N O T E S C-Bus Voltage Calculation Designer note number: 3-12-1256 Designer: Darren Snodgrass Contact Person: Darren Snodgrass Aroved: Date: Synosis: The guidelines used by installers
More informationSchedule. Logic (master program) Literature & Online Material. gic. Time and Place. Literature. Exercises & Exam. Online Material
OLC mputational gic Schedule Time and Place Thursday, 8:15 9:45, HS E Logic (master program) Georg Moser Institute of Computer Science @ UIBK week 1 October 2 week 8 November 20 week 2 October 9 week 9
More informationMultiperiod Portfolio Optimization with General Transaction Costs
Multieriod Portfolio Otimization with General Transaction Costs Victor DeMiguel Deartment of Management Science and Oerations, London Business School, London NW1 4SA, UK, avmiguel@london.edu Xiaoling Mei
More informationA Logic Approach for LTL System Modification
A Logic Approach for LTL System Modification Yulin Ding and Yan Zhang School of Computing & Information Technology University of Western Sydney Kingswood, N.S.W. 1797, Australia email: {yding,yan}@cit.uws.edu.au
More informationFailure Behavior Analysis for Reliable Distributed Embedded Systems
Failure Behavior Analysis for Reliable Distributed Embedded Systems Mario Tra, Bernd Schürmann, Torsten Tetteroo {tra schuerma tetteroo}@informatik.uni-kl.de Deartment of Comuter Science, University of
More informationUsing Patterns and Composite Propositions to Automate the Generation of Complex LTL
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 8-1-2007 Using Patterns and Composite Propositions to Automate the Generation of Complex
More informationTOWARDS REAL-TIME METADATA FOR SENSOR-BASED NETWORKS AND GEOGRAPHIC DATABASES
TOWARDS REAL-TIME METADATA FOR SENSOR-BASED NETWORKS AND GEOGRAPHIC DATABASES C. Gutiérrez, S. Servigne, R. Laurini LIRIS, INSA Lyon, Bât. Blaise Pascal, 20 av. Albert Einstein 69621 Villeurbanne, France
More informationA computational model for MapReduce job flow
A computational model for MapReduce job flow Tommaso Di Noia, Marina Mongiello, Eugenio Di Sciascio Dipartimento di Ingegneria Elettrica e Dell informazione Politecnico di Bari Via E. Orabona, 4 70125
More informationManaging specific risk in property portfolios
Managing secific risk in roerty ortfolios Andrew Baum, PhD University of Reading, UK Peter Struemell OPC, London, UK Contact author: Andrew Baum Deartment of Real Estate and Planning University of Reading
More informationStochastic Derivation of an Integral Equation for Probability Generating Functions
Journal of Informatics and Mathematical Sciences Volume 5 (2013), Number 3,. 157 163 RGN Publications htt://www.rgnublications.com Stochastic Derivation of an Integral Equation for Probability Generating
More informationLecture 9 verifying temporal logic
Basics of advanced software systems Lecture 9 verifying temporal logic formulae with SPIN 21/01/2013 1 Outline for today 1. Introduction: motivations for formal methods, use in industry 2. Developing models
More informationProbabilistic models for mechanical properties of prestressing strands
Probabilistic models for mechanical roerties of restressing strands Luciano Jacinto a, Manuel Pia b, Luís Neves c, Luís Oliveira Santos b a Instituto Suerior de Engenharia de Lisboa, Rua Conselheiro Emídio
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationEffect Sizes Based on Means
CHAPTER 4 Effect Sizes Based on Means Introduction Raw (unstardized) mean difference D Stardized mean difference, d g Resonse ratios INTRODUCTION When the studies reort means stard deviations, the referred
More informationGrade 7/8 Math Circles Sequences and Series
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Sequences and Series November 30, 2012 What are sequences? A sequence is an ordered
More informationPath Querying on Graph Databases
Path Querying on Graph Databases Jelle Hellings Hasselt University and transnational University of Limburg 1/38 Overview Graph Databases Motivation Walk Logic Relations with FO and MSO Relations with CTL
More informationComputational Finance The Martingale Measure and Pricing of Derivatives
1 The Martingale Measure 1 Comutational Finance The Martingale Measure and Pricing of Derivatives 1 The Martingale Measure The Martingale measure or the Risk Neutral robabilities are a fundamental concet
More informationtutorial: hardware and software model checking
tutorial: hardware and software model checking gerard holzmann and anuj puri { gerard anuj } @research.bell-labs.com Bell Labs, USA outline introduction (15 mins) theory and algorithms system modeling
More informationFluent Software Training TRN-99-003. Solver Settings. Fluent Inc. 2/23/01
Solver Settings E1 Using the Solver Setting Solver Parameters Convergence Definition Monitoring Stability Accelerating Convergence Accuracy Grid Indeendence Adation Aendix: Background Finite Volume Method
More informationPrice Elasticity of Demand MATH 104 and MATH 184 Mark Mac Lean (with assistance from Patrick Chan) 2011W
Price Elasticity of Demand MATH 104 and MATH 184 Mark Mac Lean (with assistance from Patrick Chan) 2011W The rice elasticity of demand (which is often shortened to demand elasticity) is defined to be the
More informationOn the Modeling and Verification of Security-Aware and Process-Aware Information Systems
On the Modeling and Verification of Security-Aware and Process-Aware Information Systems 29 August 2011 What are workflows to us? Plans or schedules that map users or resources to tasks Such mappings may
More informationConcurrent Program Synthesis Based on Supervisory Control
010 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 30-July 0, 010 ThB07.5 Concurrent Program Synthesis Based on Suervisory Control Marian V. Iordache and Panos J. Antsaklis Abstract
More informationThe Economics of the Cloud: Price Competition and Congestion
Submitted to Oerations Research manuscrit The Economics of the Cloud: Price Cometition and Congestion Jonatha Anselmi Basque Center for Alied Mathematics, jonatha.anselmi@gmail.com Danilo Ardagna Di. di
More informationENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS
ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS Liviu Grigore Comuter Science Deartment University of Illinois at Chicago Chicago, IL, 60607 lgrigore@cs.uic.edu Ugo Buy Comuter Science
More informationFREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES
FREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES AVNER ASH, LAURA BELTIS, ROBERT GROSS, AND WARREN SINNOTT Abstract. We consider statistical roerties of the sequence of ordered airs obtained by taking
More informationA Modified Measure of Covert Network Performance
A Modified Measure of Covert Network Performance LYNNE L DOTY Marist College Deartment of Mathematics Poughkeesie, NY UNITED STATES lynnedoty@maristedu Abstract: In a covert network the need for secrecy
More informationMortgage Trading Exchange (MTE)
Mortgage Trading Exchange (MTE) 0871 384 0055 www.mortgage-brain.co.uk/mte Completing an application form There are two ways to access MTE to complete a form. If accessing MTE from the Launch screen of
More informationFrequentist vs. Bayesian Statistics
Bayes Theorem Frequentist vs. Bayesian Statistics Common situation in science: We have some data and we want to know the true hysical law describing it. We want to come u with a model that fits the data.
More informationPythagorean Triples and Rational Points on the Unit Circle
Pythagorean Triles and Rational Points on the Unit Circle Solutions Below are samle solutions to the roblems osed. You may find that your solutions are different in form and you may have found atterns
More informationc 2009 Je rey A. Miron 3. Examples: Linear Demand Curves and Monopoly
Lecture 0: Monooly. c 009 Je rey A. Miron Outline. Introduction. Maximizing Pro ts. Examles: Linear Demand Curves and Monooly. The Ine ciency of Monooly. The Deadweight Loss of Monooly. Price Discrimination.
More informationSTABILITY OF PNEUMATIC and HYDRAULIC VALVES
STABILITY OF PNEUMATIC and HYDRAULIC VALVES These three tutorials will not be found in any examination syllabus. They have been added to the web site for engineers seeking knowledge on why valve elements
More informationComparing Dissimilarity Measures for Symbolic Data Analysis
Comaring Dissimilarity Measures for Symbolic Data Analysis Donato MALERBA, Floriana ESPOSITO, Vincenzo GIOVIALE and Valentina TAMMA Diartimento di Informatica, University of Bari Via Orabona 4 76 Bari,
More informationLarge firms and heterogeneity: the structure of trade and industry under oligopoly
Large firms and heterogeneity: the structure of trade and industry under oligooly Eddy Bekkers University of Linz Joseh Francois University of Linz & CEPR (London) ABSTRACT: We develo a model of trade
More informationOne-Chip Linear Control IPS, F5106H
One-Chi Linear Control IPS, F5106H NAKAGAWA Sho OE Takatoshi IWAMOTO Motomitsu ABSTRACT In the fi eld of vehicle electrical comonents, the increasing demands for miniaturization, reliability imrovement
More informationOn Software Piracy when Piracy is Costly
Deartment of Economics Working aer No. 0309 htt://nt.fas.nus.edu.sg/ecs/ub/w/w0309.df n Software iracy when iracy is Costly Sougata oddar August 003 Abstract: The ervasiveness of the illegal coying of
More informationRisk in Revenue Management and Dynamic Pricing
OPERATIONS RESEARCH Vol. 56, No. 2, March Aril 2008,. 326 343 issn 0030-364X eissn 1526-5463 08 5602 0326 informs doi 10.1287/ore.1070.0438 2008 INFORMS Risk in Revenue Management and Dynamic Pricing Yuri
More informationFirst Law, Heat Capacity, Latent Heat and Enthalpy
First Law, Heat Caacity, Latent Heat and Enthaly Stehen R. Addison January 29, 2003 Introduction In this section, we introduce the first law of thermodynamics and examine sign conentions. Heat and Work
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationALGEBRAIC SIGNATURES FOR SCALABLE WEB DATA INTEGRATION FOR ELECTRONIC COMMERCE TRANSACTIONS
ALGEBRAIC SIGNATURES FOR SCALABLE WEB DATA INTEGRATION FOR ELECTRONIC COMMERCE TRANSACTIONS Chima Adiele Deartment of Comuter Science University of Manitoba adiele@cs.umanitoba.ca Sylvanus A. Ehikioya
More informationConstructing Automata from Temporal Logic Formulas : A Tutorial
Constructing Automata from Temporal Logic Formulas : A Tutorial Pierre Wolper Université de Liège, Institut Montefiore, B28, 4000 Liège, Belgium pw@montefiore.ulg.ac.be, http://www.montefiore.ulg.ac.be/~pw/
More informationPressure Drop in Air Piping Systems Series of Technical White Papers from Ohio Medical Corporation
Pressure Dro in Air Piing Systems Series of Technical White Paers from Ohio Medical Cororation Ohio Medical Cororation Lakeside Drive Gurnee, IL 600 Phone: (800) 448-0770 Fax: (847) 855-604 info@ohiomedical.com
More informationDrinking water systems are vulnerable to
34 UNIVERSITIES COUNCIL ON WATER RESOURCES ISSUE 129 PAGES 34-4 OCTOBER 24 Use of Systems Analysis to Assess and Minimize Water Security Risks James Uber Regan Murray and Robert Janke U. S. Environmental
More informationLarge Sample Theory. Consider a sequence of random variables Z 1, Z 2,..., Z n. Convergence in probability: Z n
Large Samle Theory In statistics, we are interested in the roerties of articular random variables (or estimators ), which are functions of our data. In ymtotic analysis, we focus on describing the roerties
More informationLocal Connectivity Tests to Identify Wormholes in Wireless Networks
Local Connectivity Tests to Identify Wormholes in Wireless Networks Xiaomeng Ban Comuter Science Stony Brook University xban@cs.sunysb.edu Rik Sarkar Comuter Science Freie Universität Berlin sarkar@inf.fu-berlin.de
More informationA Propositional Dynamic Logic for CCS Programs
A Propositional Dynamic Logic for CCS Programs Mario R. F. Benevides and L. Menasché Schechter {mario,luis}@cos.ufrj.br Abstract This work presents a Propositional Dynamic Logic in which the programs are
More informationIntroduction to SPIN. Acknowledgments. Parts of the slides are based on an earlier lecture by Radu Iosif, Verimag. Ralf Huuck. Features PROMELA/SPIN
Acknowledgments Introduction to SPIN Parts of the slides are based on an earlier lecture by Radu Iosif, Verimag. Ralf Huuck Ralf Huuck COMP 4152 1 Ralf Huuck COMP 4152 2 PROMELA/SPIN PROMELA (PROcess MEta
More informationSoftware Engineering using Formal Methods
Software Engineering using Formal Methods Model Checking with Temporal Logic Wolfgang Ahrendt 24th September 2013 SEFM: Model Checking with Temporal Logic /GU 130924 1 / 33 Model Checking with Spin model
More informationNormally Distributed Data. A mean with a normal value Test of Hypothesis Sign Test Paired observations within a single patient group
ANALYSIS OF CONTINUOUS VARIABLES / 31 CHAPTER SIX ANALYSIS OF CONTINUOUS VARIABLES: COMPARING MEANS In the last chater, we addressed the analysis of discrete variables. Much of the statistical analysis
More informationFundamentals of Software Engineering
Fundamentals of Software Engineering Model Checking with Temporal Logic Ina Schaefer Institute for Software Systems Engineering TU Braunschweig, Germany Slides by Wolfgang Ahrendt, Richard Bubel, Reiner
More informationFinding a Needle in a Haystack: Pinpointing Significant BGP Routing Changes in an IP Network
Finding a Needle in a Haystack: Pinointing Significant BGP Routing Changes in an IP Network Jian Wu, Zhuoqing Morley Mao University of Michigan Jennifer Rexford Princeton University Jia Wang AT&T Labs
More informationSoftware Cognitive Complexity Measure Based on Scope of Variables
Software Cognitive Comlexity Measure Based on Scoe of Variables Kwangmyong Rim and Yonghua Choe Faculty of Mathematics, Kim Il Sung University, D.P.R.K mathchoeyh@yahoo.com Abstract In this aer, we define
More informationMemory management. Chapter 4: Memory Management. Memory hierarchy. In an ideal world. Basic memory management. Fixed partitions: multiple programs
Memory management Chater : Memory Management Part : Mechanisms for Managing Memory asic management Swaing Virtual Page relacement algorithms Modeling age relacement algorithms Design issues for aging systems
More informationFormal Verification of Software
Formal Verification of Software Sabine Broda Department of Computer Science/FCUP 12 de Novembro de 2014 Sabine Broda (DCC-FCUP) Formal Verification of Software 12 de Novembro de 2014 1 / 26 Formal Verification
More informationPoint Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11)
Point Location Prerocess a lanar, olygonal subdivision for oint location ueries. = (18, 11) Inut is a subdivision S of comlexity n, say, number of edges. uild a data structure on S so that for a uery oint
More informationDETERMINATION OF THE SOIL FRICTION COEFFICIENT AND SPECIFIC ADHESION
TEKA Kom. Mot. Energ. Roln., 5, 5, 1 16 DETERMINATION OF THE SOIL FRICTION COEFFICIENT AND SPECIFIC ADHESION Arvids Vilde,Wojciech Tanaś Research Institute o Agricultural Machinery, Latvia University o
More informationThe Economics of the Cloud: Price Competition and Congestion
Submitted to Oerations Research manuscrit (Please, rovide the manuscrit number!) Authors are encouraged to submit new aers to INFORMS journals by means of a style file temlate, which includes the journal
More informationOn the predictive content of the PPI on CPI inflation: the case of Mexico
On the redictive content of the PPI on inflation: the case of Mexico José Sidaoui, Carlos Caistrán, Daniel Chiquiar and Manuel Ramos-Francia 1 1. Introduction It would be natural to exect that shocks to
More informationStatic and Dynamic Properties of Small-world Connection Topologies Based on Transit-stub Networks
Static and Dynamic Proerties of Small-world Connection Toologies Based on Transit-stub Networks Carlos Aguirre Fernando Corbacho Ramón Huerta Comuter Engineering Deartment, Universidad Autónoma de Madrid,
More informationEfficient Partitioning of Memory Systems and Its Importance for Memory Consolidation
Efficient Partitioning of Memory Systems and Its Imortance for Memory Consolidation Alex Roxin 1,2, Stefano Fusi 1 * 1 Center for Theoretical Neuroscience, Columbia University, New York, New York, United
More informationHALF-WAVE & FULL-WAVE RECTIFICATION
HALF-WAE & FULL-WAE RECTIFICATION Objectives: HALF-WAE & FULL-WAE RECTIFICATION To recognize a half-wave rectified sinusoidal voltage. To understand the term mean value as alied to a rectified waveform.
More informationUniversität Stuttgart Fakultät Informatik, Elektrotechnik und Informationstechnik
Universität Stuttgart Fakultät Informatik, Elektrotechnik und Informationstechnik Infinite State Model-Checking of Propositional Dynamic Logics Stefan Göller and Markus Lohrey Report Nr. 2006/04 Institut
More informationCalculation of losses in electric power cables as the base for cable temperature analysis
Calculation of losses in electric ower cables as the base for cable temerature analysis I. Sarajcev 1, M. Majstrovic & I. Medic 1 1 Faculty of Electrical Engineering, University of Slit, Croatia Energy
More informationPRIME NUMBERS AND THE RIEMANN HYPOTHESIS
PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and exlain how it is connected with the rime numbers.
More informationOverview Motivating Examples Interleaving Model Semantics of Correctness Testing, Debugging, and Verification
Introduction Overview Motivating Examples Interleaving Model Semantics of Correctness Testing, Debugging, and Verification Advanced Topics in Software Engineering 1 Concurrent Programs Characterized by
More informationF inding the optimal, or value-maximizing, capital
Estimating Risk-Adjusted Costs of Financial Distress by Heitor Almeida, University of Illinois at Urbana-Chamaign, and Thomas Philion, New York University 1 F inding the otimal, or value-maximizing, caital
More informationLectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields. Tom Weston
Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields Tom Weston Contents Introduction 4 Chater 1. Comlex lattices and infinite sums of Legendre symbols 5 1. Comlex lattices 5
More informationINF5140: Specification and Verification of Parallel Systems
Motivation INF5140: Specification and Verification of Parallel Systems Lecture 1 Introduction: Formal Methods Gerardo Schneider Department of Informatics University of Oslo INF5140, Spring 2009 Outline
More information