towards efficient model checking for variants of atl
play

Towards efficient model checking for variants of ATL under different - PowerPoint PPT Presentation

Jul 08, 2023 •210 likes •1.1k views

Specification of Strategic Abilities in ATL* Model checking Multi-Valued ATL* Partial order reductions for sATL* Simpler strategies for Timed ATL Conclusions Towards efficient model checking for variants of ATL under different semantics

  1. Specification of Strategic Abilities in ATL* Model checking Multi-Valued ATL* Partial order reductions for sATL* Simpler strategies for Timed ATL Conclusions Towards efficient model checking for variants of ATL under different semantics Wojciech Penczek a joint work with W. Jamroga, B. Konikowska, M. Knapik, L. Petrruci and A. Etienne Institute of Computer Sciences, PAS, Warsaw, and Siedlce University, Poland Bordeaux, Talence, WG2.2 Meeting, the 20th of September Wojciech Penczek et al. Towards efficient model checking .. ATL .. 1/47

  2. Specification of Strategic Abilities in ATL* Model checking Multi-Valued ATL* Partial order reductions for sATL* Simpler strategies for Timed ATL Conclusions Outline Introduction to specification of strategic abilities in ATL*, Model checking multi-valued version of ATL*, Partial order reductions for sATL*, Simpler strategies for Timed ATL (if time permits). Wojciech Penczek et al. Towards efficient model checking .. ATL .. 2/47

  3. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions Specification and Verification of Strategic Ability Many important properties are based on strategic ability Functionality ≈ ability of authorized users to complete some tasks Security ≈ inability of unauthorized users to complete certain tasks One can try to formalize such properties in modal logics of strategic ability, such as ATL or Strategy Logic ...and verify them by model checking Wojciech Penczek et al. Towards efficient model checking .. ATL .. 3/47

  4. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions Specification and Verification of Strategic Ability Many important properties are based on strategic ability Functionality ≈ ability of authorized users to complete some tasks Security ≈ inability of unauthorized users to complete certain tasks One can try to formalize such properties in modal logics of strategic ability, such as ATL or Strategy Logic ...and verify them by model checking Wojciech Penczek et al. Towards efficient model checking .. ATL .. 3/47

  5. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions Specification and Verification of Strategic Ability Many important properties are based on strategic ability Functionality ≈ ability of authorized users to complete some tasks Security ≈ inability of unauthorized users to complete certain tasks One can try to formalize such properties in modal logics of strategic ability, such as ATL or Strategy Logic ...and verify them by model checking Wojciech Penczek et al. Towards efficient model checking .. ATL .. 3/47

  6. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions Motivation: VoteVerif New project has just began between the Polish Academy of Sciences and University of Luxembourg VoteVerif : Verification of Voter-Verifiable Voting Protocols Example properties: ballot confidentiality, coercion-resistance, end-to-end voter-verifiability Underpinned by existence (or nonexistence) of a suitable strategy for the voter and/or the coercer Wojciech Penczek et al. Towards efficient model checking .. ATL .. 4/47

  7. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions Motivation: VoteVerif New project has just began between the Polish Academy of Sciences and University of Luxembourg VoteVerif : Verification of Voter-Verifiable Voting Protocols Example properties: ballot confidentiality, coercion-resistance, end-to-end voter-verifiability Underpinned by existence (or nonexistence) of a suitable strategy for the voter and/or the coercer Wojciech Penczek et al. Towards efficient model checking .. ATL .. 4/47

  8. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions Papers introducing ATL* and TATL Alternating-time temporal logic [Alur et al. 1997-2002] Timed alternating-time temporal logic [Henzinger and Prabhu, LAMAS 2006] Model checking timed ATL for durational concurrent game structures [Laroussinie, Markey, Oreiby, LAMAS 2006] Wojciech Penczek et al. Towards efficient model checking .. ATL .. 5/47

  9. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions ATL: What Agents Can Achieve ATL: Alternating-time Temporal Logic Temporal logic meets game theory Main idea: cooperation modalities � � A � � φ : coalition A has a collective strategy to enforce φ ❀ φ can include temporal operators: X (next), F (sometime in the future), G (always in the future), U (strong until) Wojciech Penczek et al. Towards efficient model checking .. ATL .. 6/47

  10. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions Semantic Variants of ATL Basic semantics of ATL assumes perfect information - not very realistic Semantic variants for more realistic cases defined in (Jamroga 2003), (Jonker 2003), (Schobbens 2004), (Jamroga & van der Hoek 2004), (Agotnes 2004), ... Encapsulate different assumptions about agents and abilities Wojciech Penczek et al. Towards efficient model checking .. ATL .. 7/47

  11. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions Semantic Variants of ATL* Memory of agents: Perfect Recall (R) vs. imperfect recall strategies (r) Available information: Perfect Information (I) vs. imperfect information strategies (i) Wojciech Penczek et al. Towards efficient model checking .. ATL .. 8/47

  12. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions ATL: What Agents Can Achieve Example formulae: � i ∈ Candidates � � v � � F voted v , i : “The voter can cast her vote in an arbitrary way” ¬� � c , v � � F � i ∈ Candidates K c voted v , i : “The coercer cannot learn how the voter voted even if the voter cooperates with the coercer” (in ATL + K) So, let’s specify and model-check ! Not that easy... Wojciech Penczek et al. Towards efficient model checking .. ATL .. 9/47

  13. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions ATL: What Agents Can Achieve Example formulae: � i ∈ Candidates � � v � � F voted v , i : “The voter can cast her vote in an arbitrary way” ¬� � c , v � � F � i ∈ Candidates K c voted v , i : “The coercer cannot learn how the voter voted even if the voter cooperates with the coercer” (in ATL + K) So, let’s specify and model-check ! Not that easy... Wojciech Penczek et al. Towards efficient model checking .. ATL .. 9/47

  14. Specification of Strategic Abilities in ATL* Introduction Model checking Multi-Valued ATL* Semantic Variants of ATL Partial order reductions for sATL* Complexity Obstacles Simpler strategies for Timed ATL Possible ways out Conclusions ATL: What Agents Can Achieve Example formulae: � i ∈ Candidates � � v � � F voted v , i : “The voter can cast her vote in an arbitrary way” ¬� � c , v � � F � i ∈ Candidates K c voted v , i : “The coercer cannot learn how the voter voted even if the voter cooperates with the coercer” (in ATL + K) So, let’s specify and model-check ! Not that easy... Wojciech Penczek et al. Towards efficient model checking .. ATL .. 9/47

Recommend

Statistical Statistical Statistical Model Statistical Model Model Checking Model Checking

Statistical Statistical Statistical Model Statistical Model Model Checking Model Checking

Statistical Statistical Statistical Model Statistical Model Model Checking Model Checking Checking Checking for Timed Automata Timed Automata Coll C l C ll b llabora orators: t ors: Peter Bulychev, Alexandre David Axel Legay, Marius

725 views • 59 slides
Hoare Logic and Model Checking Model Checking Lecture 11: Model checking for Computation Tree

Hoare Logic and Model Checking Model Checking Lecture 11: Model checking for Computation Tree

Hoare Logic and Model Checking Model Checking Lecture 11: Model checking for Computation Tree Logic Dominic Mulligan Based on previous slides by Alan Mycroft and Mike Gordon Programming, Logic, and Semantics Group University of Cambridge

402 views • 25 slides
Efficient Probabilistic Model Checking of Systems with Ranged Probabilities Khalil Ghorbal 1 , 2

Efficient Probabilistic Model Checking of Systems with Ranged Probabilities Khalil Ghorbal 1 , 2

Introduction Bounded Properties Unbounded Properties Experiments Efficient Probabilistic Model Checking of Systems with Ranged Probabilities Khalil Ghorbal 1 , 2 Parasara Sridhar Duggirala 1 , 3 c 1 Vineet Kahlon 1 Aarti Gupta 1 Franjo Ivan

400 views • 28 slides
Model Checking Lots of Systems Efficient Verification of Temporal Properties in Software Product

Model Checking Lots of Systems Efficient Verification of Temporal Properties in Software Product

Model Checking Lots of Systems Efficient Verification of Temporal Properties in Software Product Lines Andreas Classen, Patrick Heymans, Pierre-Yves Schobbens, Axel Legay, Jean-Franois Raskin (2010) Presented by Laura Walsh 1 Overview 1.

401 views • 28 slides
Bounded Model Checking bmc Revision: 1.11 1 [BiereCimattiClarkeZhu99] uses SAT for model

Bounded Model Checking bmc Revision: 1.11 1 [BiereCimattiClarkeZhu99] uses SAT for model

Bounded Model Checking bmc Revision: 1.11 1 [BiereCimattiClarkeZhu99] uses SAT for model checking historically not the first symbolic model checking approach scales better than original BDD based techniques mostly incomplete in

521 views • 28 slides
CTL Chapter 6 Part 2 Overview Review CTL Model Checking CTL model Checking algorithms

CTL Chapter 6 Part 2 Overview Review CTL Model Checking CTL model Checking algorithms

CTL Chapter 6 Part 2 Overview Review CTL Model Checking CTL model Checking algorithms for ( U ) Counter Examples and witnesses Symbolic Model Checking (Thursday) Binary Decision Trees

740 views • 40 slides
Hoare Logic and Model Checking Model Checking But perhaps theres a clever way of

Hoare Logic and Model Checking Model Checking But perhaps theres a clever way of

Hoare Logic and Model Checking Model Checking But perhaps theres a clever way of compiling one into the other? Both have very different models of time How do they compare? We have seen two widely used temporal logics Relative

510 views • 10 slides
Hoare Logic and Model Checking 1. You should be able to model simple systems in NuSMV, an LTL

Hoare Logic and Model Checking 1. You should be able to model simple systems in NuSMV, an LTL

Hoare Logic and Model Checking 1. You should be able to model simple systems in NuSMV, an LTL Other interesting books: Model Checking by Clarke, Grumberg, and Peled Principles of Model Checking by Baier and Katoen 3 Course

636 views • 11 slides
Efficient Model Checking of Safety Properties Timo Latvala timo.latvala@hut.fi Laboratory for

Efficient Model Checking of Safety Properties Timo Latvala timo.latvala@hut.fi Laboratory for

Efficient Model Checking of Safety Properties Timo Latvala timo.latvala@hut.fi Laboratory for Theoretical Computer Science Helsinki University of Technology Finland Spin 2003 p.1/16 Introduction Safety properties properties

669 views • 44 slides
Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and

Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and

Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and Extensible Model Checking Framework a Modular and Extensible Model Checking Framework 3rd Estonian Summer School in Computer and System Science

301 views • 8 slides
Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and

Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and

Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and Extensible Model Checking Framework a Modular and Extensible Model Checking Framework 3rd Estonian Summer School in Computer and System Science

777 views • 31 slides
Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and

Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and

Software Model Checking Using Bogor Software Model Checking Using Bogor a Modular and Extensible Model Checking Framework a Modular and Extensible Model Checking Framework 3rd Estonian Summer School in Computer and System Science

628 views • 34 slides
Modeling and Analyzing Concurrent Systems using Model Checking Robert B. France 1 What is

Modeling and Analyzing Concurrent Systems using Model Checking Robert B. France 1 What is

Modeling and Analyzing Concurrent Systems using Model Checking Robert B. France 1 What is Model Checking? Model checking is an automated technique that, given a finite-state model of a system and a logical property , systematically

484 views • 36 slides
Model Checking: the Interval Way Alberto Molinari ( j.w. with L. Bozzelli, A. Montanari, A. Peron,

Model Checking: the Interval Way Alberto Molinari ( j.w. with L. Bozzelli, A. Montanari, A. Peron,

Model Checking: the Interval Way Alberto Molinari ( j.w. with L. Bozzelli, A. Montanari, A. Peron, P. Sala ) University of Udine Department of Mathematics, Computer Science, and Physics (DMIF) July 27, 2018 MODEL CHECKING Model checking : the

701 views • 38 slides
Automated Reasoning LTL Model Checking Alan Bundy Automated Reasoning LTL Model Checking

Automated Reasoning LTL Model Checking Alan Bundy Automated Reasoning LTL Model Checking

Automated Reasoning LTL Model Checking Alan Bundy Automated Reasoning LTL Model Checking Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures

639 views • 26 slides
Hoare Logic and Model Checking Model Checking Lecture 7: Introduction and background Dominic

Hoare Logic and Model Checking Model Checking Lecture 7: Introduction and background Dominic

Hoare Logic and Model Checking Model Checking Lecture 7: Introduction and background Dominic Mulligan Based on previous slides by Alan Mycroft and Mike Gordon Programming, Logic, and Semantics Group, University of Cambridge Academic year

972 views • 41 slides
Hoare Logic and Model Checking Model Checking See NuSMV homepage to download: http://nusmv.fbk.eu/

Hoare Logic and Model Checking Model Checking See NuSMV homepage to download: http://nusmv.fbk.eu/

Hoare Logic and Model Checking Model Checking See NuSMV homepage to download: http://nusmv.fbk.eu/ Was popular in semiconductor industry via Cadence SMV Could handle large models A re-implementation of the SMV model checker: Good

110 views • 10 slides
Probabilisti tic Model Checking in Practi tice Dave Parker Oxford University

Probabilisti tic Model Checking in Practi tice Dave Parker Oxford University

Probabilisti tic Model Checking in Practi tice Dave Parker Oxford University Computing Laboratory Quantitative Model Checking PhD School, Copenhagen, March 2010 Overview Tool support for probabilistic model checking The PRISM

317 views • 14 slides
Hoare Logic and Model Checking Model Checking Lecture 10: Computation Tree Logic (CTL) Dominic

Hoare Logic and Model Checking Model Checking Lecture 10: Computation Tree Logic (CTL) Dominic

Hoare Logic and Model Checking Model Checking Lecture 10: Computation Tree Logic (CTL) Dominic Mulligan Based on previous slides by Alan Mycroft and Mike Gordon Programming, Logic, and Semantics Group University of Cambridge Academic year

1.15k views • 48 slides
Model Checking in Systems Biology s Brim and Milan ska and David Lubo Ce Safr

Model Checking in Systems Biology s Brim and Milan ska and David Lubo Ce Safr

Model Checking in Systems Biology s Brim and Milan ska and David Lubo Ce Safr anek Masaryk University Czech Republic SFM 2013 1/150 Outline Introduction 1 LTL Model Checking 2 Parallel LTL Model Checking 3 Discrete

2.18k views • 199 slides
Verified Efficient Clausal Proof Checking for SAT Filip Mari c, Faculty of Mathematics,

Verified Efficient Clausal Proof Checking for SAT Filip Mari c, Faculty of Mathematics,

Introduction Unsatisfiability proof formats for SAT Verified efficient checking of clausal proofs Verified Efficient Clausal Proof Checking for SAT Filip Mari c, Faculty of Mathematics, Belgrade (joint work with Florian Haftmann, TU Munich)

516 views • 26 slides
Efficient Malware Detection using Model-Checking Tayssir Touili LIPN, CNRS & Univ. Paris 13

Efficient Malware Detection using Model-Checking Tayssir Touili LIPN, CNRS & Univ. Paris 13

Efficient Malware Detection using Model-Checking Tayssir Touili LIPN, CNRS & Univ. Paris 13 Motivation: Malware Detection The number of new malware exceeds 75 million by the end of 2011, and is still increasing. The number of

1.04k views • 52 slides
Introduction to Model Checking Radu Mateescu Inria Univ. Grenoble Alpes LIG What is model

Introduction to Model Checking Radu Mateescu Inria Univ. Grenoble Alpes LIG What is model

Introduction to Model Checking Radu Mateescu Inria Univ. Grenoble Alpes LIG What is model checking? Model checking is the method by which a desired behavioral property of a reactive system is verified over a given system (the model )

606 views • 32 slides
Model Checking Finite State Finite State Model Checking Finite State Systems

Model Checking Finite State Finite State Model Checking Finite State Systems

Model Checking Finite State Finite State Model Checking Finite State Systems Informationsteknologi System Description A No! Debugging Information TOOL TOOL Yes, Requirement F Prototypes C T L Executable Code Test sequences Tools:

637 views • 34 slides

More recommend