1. CaV 2003 CbCb 1 Concurrency and Verification What? Why? How?

2. CaV 2003 CbCb 2 What? Validation and Verification of software and hardware DESIGNS! (E.g., real time systems, embedded systems, communication protocols)

3. CaV 2003 CbCb 3 A REAL real time system

4. CaV 2003 CbCb 4 Embedded Systems SyncMaster 17GLsi Telephone Tamagotchi Mobile Phone Digital Watch

5. CaV 2003 CbCb 5 Why? zTesting/simulation of designs/implementations may not reveal error zFormal verification (=exhaustive testing) of design provides 100% coverage zTOOL support.

6. CaV 2003 CbCb 6 Tools Logic Temporal Logic Modal Logic MSOL Algorithmic (Timed) Automata Theory Graph Theory BDDs Polyhedra Manipulation Semantics Concurrency Theory Abstract Interpretation Compositionality Models for real-time & hybrid systems HOL TLP Applications PVS ALF SPIN MONAUPPAAL

7. CaV 2003 CbCb 7 Model Checking TOOL System Description A Requirement F Yes, Prototypes Executable Code Test sequences No! Debugging Information Tools: UPPAAL, CPN, SPIN, VisualSTATE, Statemate, Verilog, Formalcheck,...

8. CaV 2003 CbCb 8 System Description Unified Model = State Machine! a b x y a? b? x! y!b? Control states Input ports Output ports

9. CaV 2003 CbCb 9 Train Simulator 1421 machines 11102 transitions 2981 inputs 2667 outputs 3204 local states Declare state sp.: 10^476 BUGS ? VVS visualSTATE

10. CaV 2003 CbCb 10 ‘State Explosion’ problem a cb 1 2 43 1,a 4,a 3,a4,a 1,b2,b 3,b4,b 1,c2,c 3,c4,c All combinations = exponential in no. of components M1 M2 M1 x M2

11. CaV 2003 CbCb 11 Intelligent Light Control OffLightBright press? WANT: if press is issued twice quickly then the light will get brighter; otherwise the light is turned off.

12. CaV 2003 CbCb 12 Intelligent Light Control OffLightBright press? Solution: Add real-valued clock x X:=0 X<=3 X>3

13. CaV 2003 CbCb 13 Timed Automata n m a Alur & Dill 1990 Clocks: x, y x 3 x := 0 Guard Boolean combination of comp with integer bounds Reset Action perfomed on clocks Transitions ( n, x=2.4, y=3.1415 ) ( n, x=3.5, y=4.2415 ) e(1.1) ( n, x=2.4, y=3.1415 ) ( m, x=0, y=3.1415 ) a State ( location, x=v, y=u ) where v,u are in R Action used for synchronization

14. CaV 2003 CbCb 14 Model Checking TOOL System Description A Requirement F Yes, Prototypes Executable Code Test sequences No! Debugging Information Tools: UPPAAL, CPN, SPIN, VisualSTATE, Statemate, Verilog, Formalcheck,...

15. CaV 2003 CbCb 15 Computation Tree Logic, CTL Clarke & Emerson 1980 Syntax

16. CaV 2003 CbCb 16 TCTL = CTL + Time E[  U  ], A[  U  ] - like in CTL No EX 

17. CaV 2003 CbCb 17 Infinite State Space?

18. CaV 2003 CbCb 18 Regions Alur & Dill: A Theory of Timed Automata, TCS 126, 183 - 235, 1994 Berthomieu & Menasche: An Enumerative Approach for Analyzing Timed Petri Nets, Information Processing 83, 1983 Berthomieu & Diaz: Modelling and Verification of Time Dependent Systems Using Time Petri Nets, IEEE Trans. on Soft. Eng. 17 (3), 1991

19. CaV 2003 CbCb 19 Roughly speaking.... Model checking a timed automata against a TCTL-formula amounts to model checking its region graph against a CTL-formula Model checking a timed automata against a TCTL-formula amounts to model checking its region graph against a CTL-formula

20. CaV 2003 CbCb 20 Complexity However S sys may be EXPONENTIAL in number of parallel components! -- FIXPOINT COMPUTATIONS may be carried out using ROBDD’s (Reduced Ordered Binary Decision Diagrams) Bryant, 86 However S sys may be EXPONENTIAL in number of parallel components! -- FIXPOINT COMPUTATIONS may be carried out using ROBDD’s (Reduced Ordered Binary Decision Diagrams) Bryant, 86

21. CaV 2003 CbCb 21 Problem to be solved   Model Checking TCTL is PSPACE-hard

22. CaV 2003 CbCb 22 Research opportunities zIndustrial Applications zApplications to Communication Protocols zApplication Area for Algorithmics zConcrete Projects: yVerification -> Testing ySpecifications with local modalities

23. CaV 2003 CbCb 23 Course material zJoost-Pieter Katoen: zConcepts, Algorithms, and Tools

24. CaV 2003 CbCb 24 Course structure zStudent presentations: zBrief overview of main contents zCritical assessment zExamples, applications zFollow-up on literature zSelection and solutions to exercises

25. CaV 2003 CbCb 25 Student presentations z1. Linear temporal logic, PLTL (47--66) z2. PLTL model checking (66--124) z3. Computation tree logic, CTL (127--186) z4. Real-time CTL, TCTL (189--253) z5. State-space reduction (257--290)