symbolic unfoldings for networks of timed automata

play

Symbolic Unfoldings for Networks of Timed Automata Franck Cassez 1 - PowerPoint PPT Presentation

May 07, 2023 •387 likes •1.23k views

Symbolic Unfoldings for Networks of Timed Automata Franck Cassez 1 Thomas Chatain 2 Claude Jard 2 1 CNRS/IRCCyN 2 IRISA Nantes, France Rennes, France Automated Technology for Verication and Analysis (ATVA'06) October 2326th, 2006

Symbolic Unfoldings for Networks of Timed Automata Franck Cassez 1 Thomas Chatain 2 Claude Jard 2 1 CNRS/IRCCyN 2 IRISA Nantes, France Rennes, France Automated Technology for Veri�cation and Analysis (ATVA'06) October 23–26th, 2006 Beijing, China
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Outline of the talk Unfoldings for Network of Automata ◮ Symbolic Unfoldings for Network of Timed Automata ◮ Conclusion ◮ October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 2 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Outline of the talk Unfoldings for Network of Automata ◮ Symbolic Unfoldings for Network of Timed Automata ◮ Conclusion ◮ October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 2 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Outline of the talk Unfoldings for Network of Automata ◮ Symbolic Unfoldings for Network of Timed Automata ◮ Conclusion ◮ October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 2 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Outline Unfoldings for Network of Automata ◮ Symbolic Unfoldings for Network of Timed Automata ◮ Conclusion ◮ October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 3 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Unfoldings à la McMillan For Petri Nets [McMillan, FMSD'95] For Network of Automata [Esparza & Römer, CONCUR'99] A t 2 U 0 B t 0 t 1 t 1 t 2 1 2 C V October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 4 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Unfoldings à la McMillan For Petri Nets [McMillan, FMSD'95] For Network of Automata [Esparza & Römer, CONCUR'99] A t 2 ⊥ 0 B U 0 A U t 0 t 1 t 1 t 2 e 2 t 2 1 2 C V Finite Automata V B e 1 t 0 ⇒ e 3 t 1 = 1-safe Petri net 1 2 C October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 4 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Features of Unfoldings ◮ Unfolding = 1-safe Petri net ◮ Finite “good” unfoldings exist finite complete prefix ◮ Preserves concurrency ⊥ size(unfolding) < synchronous product of TA 0 A U ◮ Can be constructed efficiently e 2 t 2 ◮ Can be used for checking properties: ◮ coverability or reachability properties B V e 1 t 0 ◮ deadlock detection e 3 t 1 ◮ temporal logics properties ◮ Can be used for diagnosis: 1 2 C ◮ Induces a partial order on events ◮ Event structure = explanations for set of events October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 5 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Features of Unfoldings ◮ Unfolding = 1-safe Petri net ◮ Finite “good” unfoldings exist finite complete prefix ◮ Preserves concurrency ⊥ size(unfolding) < synchronous product of TA 0 A U ◮ Can be constructed efficiently e 2 t 2 ◮ Can be used for checking properties: ◮ coverability or reachability properties B V e 1 t 0 ◮ deadlock detection e 3 t 1 ◮ temporal logics properties ◮ Can be used for diagnosis: 1 2 C ◮ Induces a partial order on events ◮ Event structure = explanations for set of events October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 5 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Features of Unfoldings ◮ Unfolding = 1-safe Petri net ◮ Finite “good” unfoldings exist finite complete prefix ◮ Preserves concurrency ⊥ size(unfolding) < synchronous product of TA 0 A U ◮ Can be constructed efficiently e 2 t 2 ◮ Can be used for checking properties: ◮ coverability or reachability properties B V e 1 t 0 ◮ deadlock detection e 3 t 1 ◮ temporal logics properties ◮ Can be used for diagnosis: 1 2 C ◮ Induces a partial order on events ◮ Event structure = explanations for set of events October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 5 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Features of Unfoldings ◮ Unfolding = 1-safe Petri net ◮ Finite “good” unfoldings exist finite complete prefix ◮ Preserves concurrency ⊥ size(unfolding) < synchronous product of TA 0 A U ◮ Can be constructed efficiently e 2 t 2 ◮ Can be used for checking properties: ◮ coverability or reachability properties B V e 1 t 0 ◮ deadlock detection e 3 t 1 ◮ temporal logics properties ◮ Can be used for diagnosis: 1 2 C ◮ Induces a partial order on events ◮ Event structure = explanations for set of events October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 5 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Features of Unfoldings ◮ Unfolding = 1-safe Petri net ◮ Finite “good” unfoldings exist finite complete prefix ◮ Preserves concurrency ⊥ size(unfolding) < synchronous product of TA 0 A U ◮ Can be constructed efficiently e 2 t 2 ◮ Can be used for checking properties: ◮ coverability or reachability properties B V e 1 t 0 ◮ deadlock detection e 3 t 1 ◮ temporal logics properties ◮ Can be used for diagnosis: 1 2 C ◮ Induces a partial order on events ◮ Event structure = explanations for set of events October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 5 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Features of Unfoldings ◮ Unfolding = 1-safe Petri net ◮ Finite “good” unfoldings exist finite complete prefix ◮ Preserves concurrency ⊥ size(unfolding) < synchronous product of TA 0 A U ◮ Can be constructed efficiently e 2 t 2 ◮ Can be used for checking properties: ◮ coverability or reachability properties B V e 1 t 0 ◮ deadlock detection e 3 t 1 ◮ temporal logics properties ◮ Can be used for diagnosis: 1 2 C ◮ Induces a partial order on events ◮ Event structure = explanations for set of events October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 5 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Features of Unfoldings ◮ Unfolding = 1-safe Petri net ◮ Finite “good” unfoldings exist finite complete prefix ◮ Preserves concurrency ⊥ size(unfolding) < synchronous product of TA 0 A U ◮ Can be constructed efficiently e 2 t 2 ◮ Can be used for checking properties: ◮ coverability or reachability properties B V e 1 t 0 ◮ deadlock detection e 3 t 1 ◮ temporal logics properties ◮ Can be used for diagnosis: 1 2 C ◮ Induces a partial order on events ◮ Event structure = explanations for set of events October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 5 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Network of Timed Automata A x ≤ 10 Def. of NTA Semantics of NTA t 2 ; x : = 0 0 B x ≤ 2 U y ≤ 3 t 0 ; z > 5 t 1 t 1 ; x ≤ 2 t 2 ; y ≤ 3 2 C V 1 Clocks are NOT shared October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 6 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Network of Timed Automata A x ≤ 10 Def. of NTA Semantics of NTA t 2 ; x : = 0 0 B x ≤ 2 U y ≤ 3 t 0 ; z > 5 t 1 t 1 ; x ≤ 2 t 2 ; y ≤ 3 2 C V 1 State of a NTA: ((1 , A, U ) , x = 1 , y = 1 , z = 1) Symbolic state: ((1 , A, U ) , x = y = z ∧ y ≤ 3) Clocks are NOT shared October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 6 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Network of Timed Automata A x ≤ 10 Def. of NTA Semantics of NTA t 2 ; x : = 0 0 B x ≤ 2 U y ≤ 3 t 0 ; z > 5 t 1 t 1 ; x ≤ 2 t 2 ; y ≤ 3 2 C V 1 State of a NTA: ((1 , A, U ) , x = 1 , y = 1 , z = 1) Symbolic state: ((1 , A, U ) , x = y = z ∧ y ≤ 3) Clocks are NOT shared October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 6 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Unfoldings for Network of Timed Automata ? A x ≤ 10 t 2 ; x : = 0 0 B x ≤ 2 U y ≤ 3 t 0 ; z > 5 t 1 t 1 ; x ≤ 2 t 2 ; y ≤ 3 ⊥ δ ⊥ = 0 1 2 C V 0 A U e 2 t 2 , δ e 2 ≤ 3 B V e 1 t 0 , δ e 1 > 5 e 3 t 1 , δ e 3 – δ e 2 ≤ 2 1 2 C October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 7 / 28
Unfoldings for Network of Automata Symbolic Unfoldings for NTA Conclusion Unfoldings for Network of Timed Automata ? A x ≤ 10 t 2 ; x : = 0 0 B x ≤ 2 U y ≤ 3 t 0 ; z > 5 t 1 t 1 ; x ≤ 2 t 2 ; y ≤ 3 ⊥ δ ⊥ = 0 1 2 C V 0 A U e 2 t 2 , δ e 2 ≤ 3 B V e 1 t 0 , δ e 1 > 5 e 3 t 1 , δ e 3 – δ e 2 ≤ 2 1 2 C October 2006 (ATVA’06, Beijing) Unfoldings for Networks of Timed Automata 7 / 28

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

More recommend