CPN Workshop 2006

1. Inside LoLA Experiences from building a State Space Tool for Place Transition Nets Karsten Wolf Universität Rostock

2. 1. Introduction

7. Hazard AND a b c 0 1 P(b) = 0 P(a) = 1 P(c) = 0 1 1 0 0 1 0 1 0  T 1 0 P(a): P(b): P(c): Hazard

8. The Wrapper

10. Model: AND

11. Hazard is Marking! P(a) = 1 P(b) = 0 P(c) = 0 E(a) E(b)

17. Process Sequence Flow A C D Switch B E Fault Handler Compensation Handler

19. Example: receive (cont.)

20. Analysis results Stubborn sets, Sweep-line 6,300,000 10,000 states 440,000 1,300 red. states 1,069 249 transitions 410 158 places 53 17 activities Online Shop Purchase Order

23. 2. Implementation of core units

36. Reduction techniques

47. Combination of techniques currentmarking := initial marking compute firing list do if firing list empty then take care of scc check property backtrack else fire element of firing list search & insert if new check property compute firing list else backtrack Symmetries Stubborn sets Linear algebra

49. PTN versus CPN verification with significant knowledge of the model verification with little knowledge of the model Target group easier difficult Abstraction difficult to use easy to use Linear algebra manual or user-assisted automatic Additional information CPN PTN