Automated Calculation of a Progress Measure of the Sweep-Line Method
•
0 likes•437 views
TACAS 2004
![Sometime it’s good to forget... A) store only important states - branching - cover all cycles B) throw away if they cease to be useful (*) - the sweep-line method [Mailund] (*) by help of a progress measure](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
More Related Content
What's hot
What's hot (20)
Similar to Automated Calculation of a Progress Measure of the Sweep-Line Method
Similar to Automated Calculation of a Progress Measure of the Sweep-Line Method (20)
More from Universität Rostock
More from Universität Rostock (20)
Recently uploaded
Recently uploaded (20)
Automated Calculation of a Progress Measure of the Sweep-Line Method
- 1. Automated calculation of a progress measure for the sweep-line method Karsten Schmidt Humboldt-Universit ät zu Berlin
- 2. Sometime it’s good to forget... A) store only important states - branching - cover all cycles B) throw away if they cease to be useful (*) - the sweep-line method [Mailund] (*) by help of a progress measure
- 4. The sweep-line method (Basic) Idea: state s progress value p(s) with s -t s’ p(s) p(s’) Not yet seen Processed p Unprocessed sweep-line
- 7. Petri nets 1 0 3 1 1 1 0 1 0 2 if s -- r b g y g y s’ then important: different paths to same state = linear dependency : s’ = s + w 1 , s’ = s + w 2 w 1 – w 2 = 0 3 2 3 2 0 0 -2 -1 1 + = s’ = s + 1 • + 1 • + 2 • + 2 • 1 -1 0 0 0 -1 1 3 0 0 0 0 0 1 -1 0 0 -2 -1 1 4 1 7 2 0 0 0 2 1 8 4 1 5 1 1 0 0 0 0 9
- 9. Examples U TU 1 1 1 1 1 1 2 -2 0
- 10. Geometric interpretation p 2 p 1 p 3 s U progress p(s) 1
- 14. Availability www.informatik.hu-berlin.de/~kschmidt/lola.html also: integrated into The Model Checking Kit (University of Stuttgart)