1 / 28

Process Algebra (2IF45)

Process Algebra (2IF45). Dr. Suzana Andova. Practical issues. Lecturer - Suzana Andova - Group: Software Engineering and Technology group - Section: Model Driven Software Engineering My coordinates: office HG 5.36 email s.andova@tue.nl phone: 5089. Organization. Course information

babu
Download Presentation

Process Algebra (2IF45)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Process Algebra (2IF45) Dr. Suzana Andova

  2. Practical issues • Lecturer - Suzana Andova - Group: Software Engineering and Technology group - Section: Model Driven Software Engineering • My coordinates: • office HG 5.36 • email s.andova@tue.nl • phone: 5089 Process Algebra (2IF45)

  3. Organization • Course information - http://www.win.tue.nl/~andova/education/2IF45/201112/201112.html • Course material • book: • Jos C.M. Baeten, T. Basten, M.A. Reniers “Process Algebra: Equational Theories of Communicating Processes” • lecture notes “Probabilistic Process Algebra” available at http://www.win.tue.nl/~andova/education/2IF45/lnpa.pdf • distributed papers • slides Process Algebra (2IF45)

  4. Organization Lectures • Quarter 3 (06-02-2012 – 02-04-2012): laplace-gebouw -1.19 • Quarter 4 (23-04-2012 – 18-06-2012): HG 6.09 Course activities • group assignments • 3 assignments = 40% of the final grade • exam = 60% of the final grade • home works • not compulsory but useful • active participation, discussion • few questionnaires – evaluation Process Algebra (2IF45)

  5. Content of the course • Equational theories and Operational semantics • Equational theory of communication processes • Equational theories for probabilistic processes Learning objectives: • be able to develop extensions of a process algebraic language, axiomatically and semantically • be able to establish and analyze relations and discover "inconsistencies" between a given equational theory and its operational semantics • be able to decide the most suitable construct(s) to specify particular system behavior • be able to specify and analyze probabilistic process specifications Process Algebra (2IF45)

  6. Questions for you • Where did you do your bachelor: • TU/e (CS, ES, WIN) • TU/e (Mechanical eng., Electrical eng. ) • HBO • Manipal • other university? • Who knows what formal methods are about? • Who is familiar with labeled transition systems? • Who is familiar with (any level) mCRL2, Chi? • Who has knowledge (any level) on model checking? • Who has knowledge on bisimulation relations? • Who is acquainted with probability theory? Process Algebra (2IF45)

  7. Questions for me? Process Algebra (2IF45)

  8. Process Algebra (2IF45)Introduction Dr. Suzana Andova

  9. Foundations (Example) • Natural numbers N = {0, 1, 2, …} • Operations: + and • The Peano axioms define the arithmetical properties of natural numbers • “ingredients” to build the set of natural numbers N • 0 constant and • s unary operator (successor function) Axiom If n is a natural number then s(n) is natural number, n N  s(n) N Process Algebra (2IF45)

  10. Foundations (Example - cont.) Addition of natural numbers • “addition” a: N x N → N is axiomatized as • a(x,0) = x • a(x,s(y)) = s(a(x,y)) Multiplication of natural numbers • “multiplication” m: N x N → N is axiomatized as • m(x,0) = 0 • m(x,s(y)) = a(m(x,y),x) Process Algebra (2IF45)

  11. Foundations (Example - cont.) Derivation of other equalities • use the axioms • derive more equalities using the following rules: • reflexivity x = x • symmetry x= y  y = x • transitivity x = y  y = z  x = z Example of a theorem: s(s(0)) = m(s(s(0)), s(0)) Process Algebra (2IF45)

  12. Foundations (Example – recap ) The Peano axioms define the arithmetical properties of natural numbers • 0 constant and • S unary operator • “addition” a: N x N → N binary function • “multiplication” m: N x N → N binary function • Terms: s(s(0)), a(s(0),m(s(0),s(s(s(0))))), 0, • n N  s(n) N • a(x,0) = x • a(x,s(y)) = s(a(x,y)) • m(x,0) = 0 • m(x,s(y)) = a(m(x,y),x) • reflexivity x = x • symmetry x= y  y = x • transitivity x = y  y = z  x = z Signature Axioms Relation (derivation rules) Process Algebra (2IF45)

  13. Foundation • Axiom is any mathematical statement that serves as a starting point from which other statements are logically derived “absolute truth” • Derivation rules are also part of the theory used to form new “truths” from the old once. • Theorems are mathematical statements that can be derived from the axioms by derivation. • Interpretation and models of an equational theory Process Algebra (2IF45)

  14. Alternative Representation of numbers: unary semantics • If we would like to represent numbers as s(s(0)) 1 s(0) 1 0 Process Algebra (2IF45)

  15. Alternative Representation of numbers: unary semantics 0      1 s(x)  x 1 1 a( s(s(0)), s(0) ) a( s(s(0)), s(s(s(0))) ) a( s(s(0)), s(s(0)) ) 1 x  x’ , y a(x,y)  x’ 1 y  y’ a(x,y)  a(x, y’)   1 1  1 1 1 s(0) 0 a( s(s(0)), 0 )   x, y a(x,y)   

  16. Alternative Representation of numbers: unary semantics 1 1 a( 0, s(s(s(0))) ) a( s(s(0)), s(s(s(0))) ) a( s(0), s(s(s(0))) )   1 1 1    1 1 a( s(s(0)), s(s(0)) ) a( s(0), s(s(0)) ) a(0, s(s(0)) )   1 1 1    1 1 a(0, s(0) ) a( s(s(0)), s(0) ) a( s(0), s(0) )   1 1 1   1  1 a( s(s(0)), 0 ) a( s(0), 0 ) a(0,0)    

  17. Process Algebra (2IF45)Representation of Reactive systems Dr. Suzana Andova

  18. Reactive systems • Reactive systems execute by reacting to stimuli from its environment • Many of them are control crucial and/or safety critical • These systems are large and usually consist of a number of components which interact with each other • Modeling reactive systems • abstract model of the system • unambiguous description • methods and tools for model analysis (verification of qualitative properties, performance analysis) Process Algebra (2IF45)

  19. Representation as Labeled transition systems in(x); y:= x+1; while (true) { out(y); }. out(x); in(y). x:= 1; y:= x+1; out(y). ?x !x ?x y:=x+1 ?y y:=x+1 !y !y Process Algebra (2IF45)

  20. Representation as Labeled transition systems VM1 VM2 VM3 ?return ?return error ?coin !tea ?coin !coffee ?coin !coffee !tea !tea !coffee User !coin ?coffee Process Algebra (2IF45)

  21. Representation as Labeled transition systems VM1 !tea !coffee ?coin composition VM1 and User User coin !coin ?coffee coffee !tea !coffee ?coin Process Algebra (2IF45)

  22. Representation as Labeled transition systems VM2 VM2’ ?return ?return ?coin ?coin ?coffee ?tea !coffee !tea !tea !coffee User !coin !coffee ?coffee Process Algebra (2IF45)

  23. Representation as Labeled transition systems VM1’ VM1’’ ?coin ?coin ?coin !coffee !tea !coffee !tea Using VM1’ Using VM1’’ coin coin coin coffee coffee Process Algebra (2IF45)

  24. Questions • When modeling a system, is an LTS a model to start with or is it something to be obtained as a final or side product? • What entities do we need to have predefined, to be able to produce an LTS? • What is a state? • What is a transition? • How do we know drawing a transition from a state s to a state s’ is right? How do we know which label to assign to it? • How do we combine LTSs? Process Algebra (2IF45)

  25. Use of LTS representations In (model checking) tools manipulating the state space (LTSs): UPPAAL, Prism, MRMC manipulating the specification (language): mCRL2, Chi, CADP, FDR, PEPA, MRMC +IMC reduction on specification components’ specifications reduction on specification … the whole system specification composition by axiom reduction on LTSs No! the state space SSpace generation verification model checking property specification Yes! Process Algebra (2IF45)

  26. Equational theory in place In (model checking) tools manipulating the state space (LTSs): UPPAAL, Prism, MRMC manipulating the specification (language): mCRL2, Chi, CADP, FDR, PEPA, MRMC updated IMC reduction on specification equiational theory (axioms) components’ specifications reduction on specification … the whole system specification composition by axiom reduction on LTSs Semantic rules No! the state space SS generation by the SOS rules verification model checking property specification Yes! Process Algebra (2IF45)

  27. Equational theory in place In (model checking) tools manipulating the state space (LTSs): UPPAAL, Prism, MRMC manipulating the specification (language): mCRL2, Chi, CADP, FDR, PEPA, MRMC updated IMC reduction to basic forms reduction on specification equiational theory (axioms) reduction by equations consistent components’ specifications reduction on specification … the whole system specification Operational semantics (SOS) composition by axiom reduction by equivalence relations (bisimulation) reduction on LTSs No! the state space SS generation by the SOS rules verification model checking property specification Yes! Process Algebra (2IF45)

  28. Equational theory in place In this course we will learn HOW to build a consistent Process Algebra = specification language + axioms + SOS rules + reduction equivalence relations so that the initial specification and the model checked LTS, they both describe the same system! In (model checking) tools manipulating the state space (LTSs): UPPAAL, Prism, MRMC manipulating the specification (language): mCRL2, Chi, CADP, FDR, PEPA, MRMC updated IMC reduction to basic forms reduction on specification equiational theory (axioms) reduction by equations consistent components’ specifications reduction on specification … the whole system specification Operational semantics (SOS) composition by axiom reduction by equivalence relations (bisimulation) reduction on LTSs No! the state space SS generation by the SOS rules verification model checking property specification Yes! Process Algebra (2IF45)

More Related