From CCS to Hybrid π via baby steps. Bill Rounds CSE, U of Michigan
|
|
- Loren Tyler
- 5 years ago
- Views:
Transcription
1 From CCS to Hybrid π via baby steps Bill Rounds CSE, U of Michigan
2 Main idea The hybrid pi-calculus extends pi-calculus by adding a component called the continuous environment, which evolves over time and interacts with a pi-process. It makes sense to extend earlier calculi like CCS this way. An environment that doesn t evolve turns out to be a store. But the name-passing features of hybrid pi suggest a name-passing regime for CCS, which amounts to parameter passing by reference.
3 CCS+ A retrofitting of CCS Get rid of value-passing Add name-passing Add explicit storage (so more like Dijkstra)
4 A small grammar for CCS P ::= 0 q S rec q.p νap (P P ) S ::= α.p (S + S) α is positive, negative, or τ
5 We extend CCS to be more Dijkstralike (already anticipated in CSP) A process can have another process as an environment, but it can also have a storage as a separate environment. Storage represented as a (finite)valuation E : Ivar N
6 Assignment statements interact with the environment. x := e is an environmental action which can be prefixed to a process. [x := 10].0 initializes x to 10.
7 New grammar for CCS+ Add a new class of names x, y, ranging over integers or reals P ::= 0 q S rec q.p νap νxp (P P ) S ::= a x.p a( x).p τ.p [x := e].p (S + S) Transition rule for assignments: (E, [x := e].p ) x:=e (E, P ) where E = E[x [[e]]].
8 Name-passing in CCS+ Consider a co-routine kind of situation: one process P is looking at the values of integer variables x and y, and wants a parallel process Q to multiply the values and return the result in a new variable, which can be passed as a pointer back to P. P ::= mult x 0, y 0.answer(z).c z.0 P sends the names x0, y0 to Q on channel mult, receives the result z on channel answer, then sends the result somewhere else on channel c.
9 The other partner Q ::= mult(x, y).νz[z := x y].answer z.q On each invocation, Q receives names x,y, declares local z, stores xy into z, sends z back to the calling process P.
10 Passing by reference in a reaction ((x 0 : 10; y 0 : 2), P Q) τ ((x 0 : 10; y 0 : 2), answer(z)c z.0 νz[z := x 0 y 0 ].answer z.q) Reaction rule: P a x 1,..., x k.p Q a (y 1,... y k )Q P Q τ P Q [y 1 x 1,..., y k x k ] (need abstractions, concretions here)
11 New local names ((E, νzq) τ (E, Q[z z 0 ])) where z 0 is fresh. ((x 0 : 10; y 0 : 2), νz[z := x 0 y 0 ].answer z.q) τ ((x 0 : 10; y 0 : 2), [z 0 := x 0 y 0 ].answer z 0.Q)) [z 0 :=x 0 y 0 ] (((x 0 : 10; y 0 : 2, z 0 : 20), answer z 0.Q))
12 Guarded assignment (Dijkstra) γ x := e where γ is a predicate on E. The assignment happens (atomically) only if E satisfies γ. By omitting the body, we get pure tests. By omitting the guard, we get an unconditional assignment.
13 What can you do with CCS+? -- Encode while-programs of the standard sort -- use Milner s encoding of ; by means of -- use rec q to define meaning of while loop -- with vector assignments, encode Petri nets
14 Petri nets %" %# %$!"!#!$ %& %' Rule for firing: if all input places are positive, remove a token from each input place and add a token to each output place t 1 ::= [(p 1, p 2 ) > (0, 0) (p 1,..., p 5 ) := (p 1,..., p 5 ) + (0, 1, 0, 1, 0)].t 1 P ::= t 1 t 2 t 3 Requires vector assignment statements
15 Making Petri nets mobile Name-passing is a way to achieve mobility (aka reconfigurability) in Petri nets. One obvious way to do this is to pass places (by reference) from one transition to another, since places are already named. Another way (Klavins) is to give the tokens names, and have them point to values. Then the input and output arcs can be named and used as channels to pass the tokens by name. This extends the colored PNs.
16 Towards hybrid systems The next step is to turn the ``storage into an active entity. P Q E x y z
17 Timed CCS We let the values pointed to by x, y, z evolve at a constant rate, as well as to remain constant (evolve at a zero rate). This involves specifying the rate as part of the environment. E = x : 3.21 ẋ : 1 y : 10 clock ẏ : 0 If processes don t pass x, y names, but can introduce clocks, this gives Timed CCS.
18 Time transitions Represent the values of all the clock variables in a state as a vector. Suppose E = E(x 0,..., x n ). Then (E(x 0, x n ), P ) t (E(x 0 + t,..., x n + t), P ) unless P ρ P where ρ is a guarded assignment with a true guard at some time s < t. The reason for this is maximal progress. A guarded assignment must execute as soon as it is enabled.
19 Example: defining a timeout (Schneider) The process Q 1 d Q2 offers a time-sensitive choice between Q1 and Q2. If Q1 performs an observable action before d time units have elapsed, then the choice is resolved for Q1 and Q2 is discarded. If Q1 performs no such action, then the process Q2 is enabled after d units of time and Q1 is discarded. Q 1 d Q2 def = νx([x. = 0].[ẋ := 1].(Q 1 + [x = d].q 2 )) where x is not free in Q 1 or Q 2 and Q 1 is itself a sum.
20 Hybrid CCS -- Allow continuously differentiable functions as values of dotted variables. -- Allow assignments to these variables which reset or combine functions using addition, multiplication -- Don t allow any name-passing -- Regard the collection of dotted variables and their values as defining a vector field -- Environments now evolve over time according to the flow determined by the vector field. -- Add invariant predicates as a component of the environment
21 An example environment current state vector field (x : 1.5, y : 0) (ẋ : x y x 3, ẏ : x + y y 3 ) {{(x, y) (x 0) (1 x 2 + y 2 2)}}. invariant region (can be a set of these) I got this out of a differential equations book. The flow stays in the described annulus.
22 Example: forming closed-loop system A plant is given by x = F(x,u) and a controller by u = G(u) The following code constructs the closed-loop combination of these: ([x := x 0 ].[ẋ := F (x, u)].0) ([u := u 0 ].[ u := G(u)].0) Executing all of these assignments in the null environment gives ( ( (x, u) : (x 0, u 0 ) (ẋ, u) : (F (x, u), G(u)) ), 0 0)
23 Hybrid CCS with name-passing: HCCS+ Allow sends and receives of environment names. Sufficient to represent mobile Petri nets, many other reconfigurable physical systems Robotic minifactory (Klavins) Built using palette of controllers, navigation functions (Saranli s talk)
24 Hybrid π-calculus ( φ-calculus) Simply allow channel names (i.e., pointers to processes) to be passed. This move is uniform in the non-hybrid and the hybrid setting. HCCS+ is useful when one has fixed system of concurrent processes, used to control differing groups of physical agents. Phi-calculus used to reconfigure the process structure itself.
25 Example: mobile phone system Communication structure: car with cell phone communicates with tower 1 until signal is too low; then finds tower 2 Interaction between car and tower 1 morphs into interaction between car and tower 2. This is accomplished by channel name-passing (Milner). Trajectory of car can be modelled explicitly or as an input function. Signal strength proportional to distance from tower. Invariant regions are simply circles around each tower. We assume circles intersect.
26
27 Logics and model-checking Various logics have been developed for hybrid systems One of the first was Davoren s extension of modal mu-calculus. It s also possible to use Buchi automata as a kind of linear temporal logic. This idea underlies SPIN, a model checker for LTL. Hosung Song (the real inventor of hybrid pi) is extending SPIN model-checking to the hybrid case.
28 Research issues Investigate the implications of these ideas with respect to other languages like CSP. That is, add name passing, both channels and environment names. Follow up the Petri net connection. Let the tokens be named, and consider a syntax for combining nets based on the process-algebra connectives. Use theory developed for nets (i.e., event structures) to study HCCS+. Bisimulation. Get a workable definition just for CCS+; then extend to more expressive languages. Integrate with current notions of bisimulations for hybrid automata. Logics. A fortiori, a logic for CCS+ is a logic for Petri nets. Moving up the scale, logics for hybrid systems (modal mu-calculus with a time modality, Davoren) can be expanded to spatial logics (Caires, Cardelli). Add continuous environments to other mobility calculi -- in particular, the ambient calculus. Important for biological applications.
29 The end.
EMBEDDED SYSTEMS WILLIAM C. ROUNDS AND HOSUNG SONG
THE φ-calculus A HYBRID EXTENSION OF THE π-calculus TO EMBEDDED SYSTEMS WILLIAM C. ROUNDS AND HOSUNG SONG 1. Introduction Embedded systems are software systems which reside in a physical environment and
More informationModels of Concurrency
Models of Concurrency GERARDO SCHNEIDER UPPSALA UNIVERSITY DEPARTMENT OF INFORMATION TECHNOLOGY UPPSALA, SWEDEN Thanks to Frank Valencia Models of Concurrency p.1/57 Concurrency is Everywhere Concurrent
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 informationInformation Systems Business Process Modelling I: Models
Information Systems 2 Information Systems 2 5. Business Process Modelling I: Models Lars Schmidt-Thieme Information Systems and Machine Learning Lab (ISMLL) Institute for Business Economics and Information
More informationReview of The π-calculus: A Theory of Mobile Processes
Review of The π-calculus: A Theory of Mobile Processes Riccardo Pucella Department of Computer Science Cornell University July 8, 2001 Introduction With the rise of computer networks in the past decades,
More informationBusiness Process Management
Business Process Management Theory: The Pi-Calculus Frank Puhlmann Business Process Technology Group Hasso Plattner Institut Potsdam, Germany 1 What happens here? We discuss the application of a general
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationTimed Automata VINO 2011
Timed Automata VINO 2011 VeriDis Group - LORIA July 18, 2011 Content 1 Introduction 2 Timed Automata 3 Networks of timed automata Motivation Formalism for modeling and verification of real-time systems.
More informationA SPATIAL LOGIC FOR THE HYBRID π-calculus
A SPATIAL LOGIC FOR THE HYBRID π-calculus WILLIAM C. ROUDS 1. Introduction In last year s HSCC conference, we introduced the Φ-calculus [8], an extension of Milner s powerful π-calculus, so that concurrent
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
More informationTrace Refinement of π-calculus Processes
Trace Refinement of pi-calculus Processes Trace Refinement of π-calculus Processes Manuel Gieseking manuel.gieseking@informatik.uni-oldenburg.de) Correct System Design, Carl von Ossietzky University of
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 informationA π-calculus with preorders
A π-calculus with preorders Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi École Normale Supérieure de Lyon Università di Bologna PACE kick-off meeting, 2013-04-23 Jean-Marie Madiot (Lyon, Bologna)
More informationA Note on Scope and Infinite Behaviour in CCS-like Calculi p.1/32
A Note on Scope and Infinite Behaviour in CCS-like Calculi GERARDO SCHNEIDER UPPSALA UNIVERSITY DEPARTMENT OF INFORMATION TECHNOLOGY UPPSALA, SWEDEN Joint work with Pablo Giambiagi and Frank Valencia A
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 informationComputer-Aided Program Design
Computer-Aided Program Design Spring 2015, Rice University Unit 3 Swarat Chaudhuri February 5, 2015 Temporal logic Propositional logic is a good language for describing properties of program states. However,
More informationEmbedded Systems 2. REVIEW: Actor models. A system is a function that accepts an input signal and yields an output signal.
Embedded Systems 2 REVIEW: Actor models A system is a function that accepts an input signal and yields an output signal. The domain and range of the system function are sets of signals, which themselves
More informationCoinductive big-step semantics and Hoare logics for nontermination
Coinductive big-step semantics and Hoare logics for nontermination Tarmo Uustalu, Inst of Cybernetics, Tallinn joint work with Keiko Nakata COST Rich Models Toolkit meeting, Madrid, 17 18 October 2013
More informationTemporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
More informationFormal 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
More information7. Queueing Systems. 8. Petri nets vs. State Automata
Petri Nets 1. Finite State Automata 2. Petri net notation and definition (no dynamics) 3. Introducing State: Petri net marking 4. Petri net dynamics 5. Capacity Constrained Petri nets 6. Petri net models
More informationProxel-Based Simulation of Stochastic Petri Nets Containing Immediate Transitions
Electronic Notes in Theoretical Computer Science Vol. 85 No. 4 (2003) URL: http://www.elsevier.nl/locate/entsc/volume85.html Proxel-Based Simulation of Stochastic Petri Nets Containing Immediate Transitions
More information1. sort of tokens (e.g. indistinguishable (black), coloured, structured,...),
7. High Level Petri-Nets Definition 7.1 A Net Type is determined if the following specification is given: 1. sort of tokens (e.g. indistinguishable (black), coloured, structured,...), 2. sort of labeling
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 informationAutomatic Generation of Polynomial Invariants for System Verification
Automatic Generation of Polynomial Invariants for System Verification Enric Rodríguez-Carbonell Technical University of Catalonia Talk at EPFL Nov. 2006 p.1/60 Plan of the Talk Introduction Need for program
More informationAn introduction to process calculi: Calculus of Communicating Systems (CCS)
An introduction to process calculi: Calculus of Communicating Systems (CCS) Lecture 2 of Modelli Matematici dei Processi Concorrenti Paweł Sobociński University of Southampton, UK Intro to process calculi:
More informationCommunicating and Mobile Systems
Communicating and Mobile Systems Overview:! Programming Model! Interactive Behavior! Labeled Transition System! Bisimulation! The π-calculus! Data Structures and λ-calculus encoding in the π-calculus References:!
More informationTemporal Logic Model Checking
18 Feb, 2009 Thomas Wahl, Oxford University Temporal Logic Model Checking 1 Temporal Logic Model Checking Thomas Wahl Computing Laboratory, Oxford University 18 Feb, 2009 Thomas Wahl, Oxford University
More informationModelling Membranes with Brane Calculi
Modelling Membranes with Brane Calculi (and translation of Brane Calculi into CLS) 1/42 Introduction A biological cellular membrane is an closed surface that can perform various molecular functions. Membranes
More informationVarieties of Stochastic Calculi
Research is what I'm doing when I don't know what I'm doing. Wernher Von Braun. Artificial Biochemistry Varieties of Stochastic Calculi Microsoft Research Trento, 26-5-22..26 www.luca.demon.co.uk/artificialbiochemistry.htm
More informationUsing the π-calculus. Overview. References
Using the π-calculus Overview Evolution Values as names Boolean values as processes Executor, a simple object model, lists The polyadic π-calculus Mobile telephones Processes as parameters A concurrent
More informationCommunicating Parallel Processes. Stephen Brookes
Communicating Parallel Processes Stephen Brookes Carnegie Mellon University Deconstructing CSP 1 CSP sequential processes input and output as primitives named parallel composition synchronized communication
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 informationUsing the π-calculus. Evolution. Values As Names 3/24/2004
3/4/004 Using the π-calculus Overview Evolution Values as names Boolean values as processes Executor, a simple object model, lists The polyadic π-calculus Mobile telephones Processes as parameters A concurrent
More informationAxiomatic Semantics. Operational semantics. Good for. Not good for automatic reasoning about programs
Review Operational semantics relatively l simple many flavors (small vs. big) not compositional (rule for while) Good for describing language implementation reasoning about properties of the language eg.
More informationFormalising the π-calculus in Isabelle
Formalising the π-calculus in Isabelle Jesper Bengtson Department of Computer Systems University of Uppsala, Sweden 30th May 2006 Overview This talk will cover the following Motivation Why are we doing
More informationLost in Translation: Hybrid-Time Flows vs Real-Time Transitions
Lost in Translation: Hybrid-Time Flows vs Real-Time Transitions P.J.L. Cuijpers, M.A. Reniers Technische Universiteit Eindhoven (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands. {P.J.L.Cuijpers,
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
More informationConcurrent Processes and Reaction
Concurrent Processes and Reaction Overview External and internal actions Observations Concurrent process expressions Structural congruence Reaction References Robin Milner, Communication and Concurrency
More informationLecture Notes: Axiomatic Semantics and Hoare-style Verification
Lecture Notes: Axiomatic Semantics and Hoare-style Verification 17-355/17-665/17-819O: Program Analysis (Spring 2018) Claire Le Goues and Jonathan Aldrich clegoues@cs.cmu.edu, aldrich@cs.cmu.edu It has
More informationStochastic Simulation.
Stochastic Simulation. (and Gillespie s algorithm) Alberto Policriti Dipartimento di Matematica e Informatica Istituto di Genomica Applicata A. Policriti Stochastic Simulation 1/20 Quote of the day D.T.
More informationIntroduction. Pedro Cabalar. Department of Computer Science University of Corunna, SPAIN 2013/2014
Introduction Pedro Cabalar Department of Computer Science University of Corunna, SPAIN cabalar@udc.es 2013/2014 P. Cabalar ( Department Introduction of Computer Science University of Corunna, SPAIN2013/2014
More informationReasoning About Imperative Programs. COS 441 Slides 10b
Reasoning About Imperative Programs COS 441 Slides 10b Last time Hoare Logic: { P } C { Q } Agenda If P is true in the initial state s. And C in state s evaluates to s. Then Q must be true in s. Program
More informationA Typed Interrupt Calculus
A Typed Interrupt Calculus Jens Palsberg Di Ma Department of Computer Science Purdue University, W. Lafayette, IN 47907 {palsberg,madi@cs.purdue.edu Abstract. Most real-time systems require responsive
More informationThe Expressivity of Universal Timed CCP: Undecidability of Monadic FLTL and Closure Operators for Security
The Expressivity of Universal Timed CCP: Undecidability of Monadic FLTL and Closure Operators for Security Carlos Olarte and Frank D. Valencia INRIA /CNRS and LIX, Ecole Polytechnique Motivation Concurrent
More informationOverview. overview / 357
Overview overview6.1 Introduction Modelling parallel systems Linear Time Properties Regular Properties Linear Temporal Logic (LTL) Computation Tree Logic syntax and semantics of CTL expressiveness of CTL
More 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 informationClassical Program Logics: Hoare Logic, Weakest Liberal Preconditions
Chapter 1 Classical Program Logics: Hoare Logic, Weakest Liberal Preconditions 1.1 The IMP Language IMP is a programming language with an extensible syntax that was developed in the late 1960s. We will
More informationAutomata-Theoretic Model Checking of Reactive Systems
Automata-Theoretic Model Checking of Reactive Systems Radu Iosif Verimag/CNRS (Grenoble, France) Thanks to Tom Henzinger (IST, Austria), Barbara Jobstmann (CNRS, Grenoble) and Doron Peled (Bar-Ilan University,
More informationONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies. Calin Belta
ONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies Provable safety for animal inspired agile flight Calin Belta Hybrid and Networked Systems (HyNeSs) Lab Department of
More informationSemantic Equivalences and the. Verification of Infinite-State Systems 1 c 2004 Richard Mayr
Semantic Equivalences and the Verification of Infinite-State Systems Richard Mayr Department of Computer Science Albert-Ludwigs-University Freiburg Germany Verification of Infinite-State Systems 1 c 2004
More informationOn the Expressive Power of Global and Local Priority in Process Calculi
On the Expressive Power of Global and Local Priority in Process Calculi Cristian Versari Nadia Busi Roberto Gorrieri Università di Bologna, Dipartimento di Scienze dell Informazione Mura Anteo Zamboni
More informationExpressiveness of Timed Events and Timed Languages
Expressiveness of Timed Events and Timed Languages Diletta R. Cacciagrano and Flavio Corradini Università di Camerino, Dipartimento di Matematica e Informatica, Camerino, 62032, Italy, {diletta.cacciagrano,
More informationRecursive equations in higher-order process calculi
Theoretical Computer Science 266 (2001) 839 852 www.elsevier.com/locate/tcs Recursive equations in higher-order process calculi Mingsheng Ying a; ;1, Martin Wirsing b a State Key Laboratory of Intelligent
More informationLinear Time Logic Control of Discrete-Time Linear Systems
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering December 2006 Linear Time Logic Control of Discrete-Time Linear Systems Paulo Tabuada
More informationOn the Decidability of Verifying LTL Properties of GOLOG Programs
On the Decidability of Verifying LTL Properties of GOLOG Programs Benjamin Zarrieß Theoretical Computer Science TU Dresden, Germany zarriess@tcs.inf.tu-dresden.de Jens Claßen Knowledge-Based Systems Group
More informationLab 2: Static Response, Cantilevered Beam
Contents 1 Lab 2: Static Response, Cantilevered Beam 3 1.1 Objectives.......................................... 3 1.2 Scalars, Vectors and Matrices (Allen Downey)...................... 3 1.2.1 Attribution.....................................
More informationReal-Time Reactive System - CCS with Time Delays
Real-Time Reactive System - CCS with Time Delays Wai Leung Sze (Stephen) Swansea University VINO 18th July 2011 Overview Introduction of real-time reactive system Describing the real-time reactive system
More informationThe Join calculus A calculus of mobile agents
The Join calculus p. 1/32 The Join calculus A calculus of mobile agents Martin Mosegaard Jensen Mobile Computing seminar 2004, DAIMI The Join calculus p. 2/32 Plan Motivation The reflexive CHAM Distribution:
More informationMODEL CHECKING FOR DYNAMIC ALLOCATION AND DEALLOCATION Extended Abstract
MODEL CHECKING FOR DYNAMIC ALLOCATION AND DEALLOCATION Extended Abstract Dino Distefano, Arend Rensink, Joost-Pieter Katoen Department of Computer Science, University of Twente P.O. Box 217, 7500 AE Enschede,
More informationDeclarative event based models of concurrency and refinement in psi-calculi
Declarative event based models of concurrency and refinement in psi-calculi Håkon Normann a,1,, Christian Johansen b,2, Thomas Hildebrandt a,1 a IT University of Copenhagen, Rued Langgaardsvej 7, 2300
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationLogic Model Checking
Logic Model Checking Lecture Notes 10:18 Caltech 101b.2 January-March 2004 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. the assignment
More informationMODEL-CHECKING IN DENSE REAL-TIME SHANT HARUTUNIAN
MODEL-CHECKING IN DENSE REAL-TIME SHANT HARUTUNIAN 1. Introduction These slides are for a talk based on the paper Model-Checking in Dense Real- Time, by Rajeev Alur, Costas Courcoubetis, and David Dill.
More informationCS357: CTL Model Checking (two lectures worth) David Dill
CS357: CTL Model Checking (two lectures worth) David Dill 1 CTL CTL = Computation Tree Logic It is a propositional temporal logic temporal logic extended to properties of events over time. CTL is a branching
More informationMaking Components Move: A Separation of Concerns Approach
Making Components Move: A Separation of Concerns Approach Dirk Pattinson, Martin Wirsing Institut für Informatik, LMU München Abstract. We present a new calculus for mobile systems, the main feature of
More informationBridging the Gap between Reactive Synthesis and Supervisory Control
Bridging the Gap between Reactive Synthesis and Supervisory Control Stavros Tripakis University of California, Berkeley Joint work with Ruediger Ehlers (Berkeley, Cornell), Stéphane Lafortune (Michigan)
More informationWhat happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z )
Starter Questions Feel free to discuss these with your neighbour: Consider two states s 1 and s 2 such that s 1, x := x + 1 s 2 If predicate P (x = y + 1) is true for s 2 then what does that tell us about
More informationStochastic Simulation of Biological Systems with Dynamical Compartments
Frontmatter Stochastic Simulation of Biological Systems with Dynamical Compartments Cristian Versari versari(at)cs.unibo.it Department of Computer Science University of Bologna Workshop on Computational
More informationMobile Processes in Bigraphs. Ole Høgh Jensen. October 2006
Mobile Processes in Bigraphs Ole Høgh Jensen October 2006 Abstract Bigraphical reactive systems (BRSs) are a formalism for modelling mobile computation. A bigraph consists of two combined mathematical
More informationSequential Logic (3.1 and is a long difficult section you really should read!)
EECS 270, Fall 2014, Lecture 6 Page 1 of 8 Sequential Logic (3.1 and 3.2. 3.2 is a long difficult section you really should read!) One thing we have carefully avoided so far is feedback all of our signals
More informationOn Frankl conjecture. Coherence in predicate logic. Algebraic theory of fuzzy languages and automata
On Frankl conjecture Vladimir Božin University of Warwick, Coventry, United Kingdom bozin@maths.warwick.ac.uk Frankl conjecture states that for every finite family of sets closed under intersections there
More informationLecture 8 : Structural Induction DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/15/2011 Lecture 8 : Structural Induction Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last week we discussed proofs by induction. We
More informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationProgram Verification Using Separation Logic
Program Verification Using Separation Logic Cristiano Calcagno Adapted from material by Dino Distefano Lecture 1 Goal of the course Study Separation Logic having automatic verification in mind Learn how
More informationMPRI C-2-3: Concurrency (Part 1 of 4)
From Computability to Concurrency Theory Calculus of Comunicating Systems CCS Verification and Specification. Expressiveness Solutions to Exercises. MPRI C-2-3: Concurrency (Part 1 of 4) Frank D. Valencia
More informationAnalysis and Optimization of Discrete Event Systems using Petri Nets
Volume 113 No. 11 2017, 1 10 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Analysis and Optimization of Discrete Event Systems using Petri Nets
More informationProgram verification. 18 October 2017
Program verification 18 October 2017 Example revisited // assume(n>2); void partition(int a[], int n) { int pivot = a[0]; int lo = 1, hi = n-1; while (lo
More informationCommunication and Concurrency: CCS
Communication and Concurrency: CCS R. Milner, A Calculus of Communicating Systems, 1980 cours SSDE Master 1 Why calculi? Prove properties on programs and languages Principle: tiny syntax, small semantics,
More informationLinear programming techniques for analysis and control of batches Petri nets
Linear programming techniques for analysis and control of batches Petri nets Isabel Demongodin, LSIS, Univ. of Aix-Marseille, France (isabel.demongodin@lsis.org) Alessandro Giua DIEE, Univ. of Cagliari,
More informationFuzzy Propositional Logic for the Knowledge Representation
Fuzzy Propositional Logic for the Knowledge Representation Alexander Savinov Institute of Mathematics Academy of Sciences Academiei 5 277028 Kishinev Moldova (CIS) Phone: (373+2) 73-81-30 EMAIL: 23LSII@MATH.MOLDOVA.SU
More informationA Propositional Dynamic Logic for Instantial Neighborhood Semantics
A Propositional Dynamic Logic for Instantial Neighborhood Semantics Johan van Benthem, Nick Bezhanishvili, Sebastian Enqvist Abstract We propose a new perspective on logics of computation by combining
More informationCSE 311: Foundations of Computing. Lecture 14: Induction
CSE 311: Foundations of Computing Lecture 14: Induction Mathematical Induction Method for proving statements about all natural numbers A new logical inference rule! It only applies over the natural numbers
More informationTemporal & Modal Logic. Acronyms. Contents. Temporal Logic Overview Classification PLTL Syntax Semantics Identities. Concurrency Model Checking
Temporal & Modal Logic E. Allen Emerson Presenter: Aly Farahat 2/12/2009 CS5090 1 Acronyms TL: Temporal Logic BTL: Branching-time Logic LTL: Linear-Time Logic CTL: Computation Tree Logic PLTL: Propositional
More informationNONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING. Alessandro Giua Xiaolan Xie
NONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING Alessandro Giua Xiaolan Xie Dip. Ing. Elettrica ed Elettronica, U. di Cagliari, Italy. Email: giua@diee.unica.it INRIA/MACSI Team, ISGMP, U. de Metz, France.
More informationModels. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation
Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of
More informationReasoning with Higher-Order Abstract Syntax and Contexts: A Comparison
1 Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison Amy Felty University of Ottawa July 13, 2010 Joint work with Brigitte Pientka, McGill University 2 Comparing Systems We focus on
More informationNCS Lecture 11 Distributed Computation for Cooperative Control. Richard M. Murray (Caltech) and Erik Klavins (U. Washington) 17 March 2008
NCS Lecture 11 Distributed Computation for Cooperative Control Richard M. Murray (Caltech) and Erik Klavins (U. Washington) 17 March 2008 Goals: Describe methods for modeling and analyzing distributed
More informationModeling & Control of Hybrid Systems. Chapter 7 Model Checking and Timed Automata
Modeling & Control of Hybrid Systems Chapter 7 Model Checking and Timed Automata Overview 1. Introduction 2. Transition systems 3. Bisimulation 4. Timed automata hs check.1 1. Introduction Model checking
More informationChecking Behavioral Conformance of Artifacts
Checking Behavioral Conformance of Artifacts Dirk Fahland Massimiliano de Leoni Boudewijn F. van Dongen Wil M.P. van der Aalst, Eindhoven University of Technology, The Netherlands (d.fahland m.d.leoni
More informationTESTING is one of the most important parts of the
IEEE TRANSACTIONS 1 Generating Complete Controllable Test Suites for Distributed Testing Robert M. Hierons, Senior Member, IEEE Abstract A test suite is m-complete for finite state machine (FSM) M if it
More informationRevising UNITY Programs: Possibilities and Limitations 1
Revising UNITY Programs: Possibilities and Limitations 1 Ali Ebnenasir, Sandeep S. Kulkarni, and Borzoo Bonakdarpour Software Engineering and Network Systems Laboratory Department of Computer Science and
More informationTemporal Logic of Actions
Advanced Topics in Distributed Computing Dominik Grewe Saarland University March 20, 2008 Outline Basic Concepts Transition Systems Temporal Operators Fairness Introduction Definitions Example TLC - A
More informationModelling Real-Time Systems. Henrik Ejersbo Jensen Aalborg University
Modelling Real-Time Systems Henrik Ejersbo Jensen Aalborg University Hybrid & Real Time Systems Control Theory Plant Continuous sensors actuators Task TaskTask Controller Program Discrete Computer Science
More informationScalable and Accurate Verification of Data Flow Systems. Cesare Tinelli The University of Iowa
Scalable and Accurate Verification of Data Flow Systems Cesare Tinelli The University of Iowa Overview AFOSR Supported Research Collaborations NYU (project partner) Chalmers University (research collaborator)
More informationAn Introduction to Hybrid Systems Modeling
CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical
More informationKnowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.
Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes
More informationLogics for Hybrid Systems
Logics for Hybrid Systems J. M. DAVOREN, MEMBER, IEEE, AND ANIL NERODE, MEMBER, IEEE Invited Paper Hybrid systems are heterogenous dynamical systems characterized by interacting continuous discrete dynamics.
More informationA Decidable Class of Planar Linear Hybrid Systems
A Decidable Class of Planar Linear Hybrid Systems Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh Viswanathan, and Geir E. Dullerud University of Illinois at Urbana-Champaign. Abstract. The paper shows
More information