tree shaped one pass tableau systems for linear temporal
play

Tree-shaped one-pass tableau systems for Linear Temporal Logic - PowerPoint PPT Presentation

Aug 27, 2023 •19 likes •489 views

Tree-shaped one-pass tableau systems for Linear Temporal Logic satisfiability checking Nicola Gigante University of Udine, Italy Joint work with Angelo Montanari, Mark Reynolds, Luca Geatti The need for formal verification Safety-critical

  1. Tree-shaped one-pass tableau systems for Linear Temporal Logic satisfiability checking Nicola Gigante University of Udine, Italy Joint work with Angelo Montanari, Mark Reynolds, Luca Geatti

  2. The need for formal verification Safety-critical systems need to avoid bugs at all costs. Formal Verification develops automatic techniques to provide mathematical proofs of software correctness. 2

  3. Formal verification and Logic In formal verification, an abstract model of the system is checked against a formal specification of the desired behavior. Systems are usually modeled as automata . Specifications are usually expressed as temporal logic formulas. This is the model checking problem. 3

  4. Linear Temporal Logic Linear Temporal Logic (LTL) is a propositional modal logic commonly used as specification language. X α α will be true at the next state. β will eventually be true, and α U β α always holds until then. F β ≡ ⊤ U β β will eventually be true. G β ≡ ¬ F ¬ β β will always be true. 4

  5. Linear Temporal Logic (2) If infinitely many requests are received, then infinitely many replies are sent. G F r − → G F q 5

  6. LTL satisfiability checking LTL satisfiability is the problem of checking whether there exists a model that satisfies a given LTL formula. Important to check consistency of specifications. Seemingly very hard problem: PSPACE -complete. Many algorithmic solutions to solve it: (Büchi) Automata-based Tableau methods Temporal resolution Reduction to model checking . . . 6

  7. Tableaux-based methods for LTL satisfiability Common tableaux-based methods for LTL are graph-shaped and require multiple passes to be built and checked for successful paths. ¬ p , q , X F p p , ¬ q , F p 7

  8. Tableaux-based methods for LTL satisfiability Common tableaux-based methods for LTL are graph-shaped and require multiple passes to be built and checked for successful paths. 7

  9. A One-Pass Tree-Shaped Tableau for LTL A one-pass tree-shaped tableau method for LTL satisfiability was recently proposed. GandALF 2016 M. Reynolds. “A New Rule for LTL Tableaux.” In: Proc. of the 7 th International Symposium on Games, Automata, Logics and Formal Verification . GandALF 2016 8

  10. A One-Pass Tree-Shaped Tableau for LTL A one-pass tree-shaped tableau method for LTL satisfiability was recently proposed, implemented. IJCAI 2016 M. Bertello, N. Gigante, A. Montanari, and M. Reynolds. “Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau.” In: Proc. of the 25 th International Joint Conference on Artificial Intelligence . IJCAI 2016 http://www.github.com/corralx/leviathan 8

  11. A One-Pass Tree-Shaped Tableau for LTL A one-pass tree-shaped tableau method for LTL satisfiability was recently proposed, implemented, and parallelized. GandALF 2017 John Christopher McCabe-Dansted and Mark Reynolds. “A Parallel Linear Temporal Logic Tableau.” In: Proceedings 8th International Symposium on Games, Automata, Logics and Formal Verification . 2017, pp. 166–179 8

  12. A One-Pass Tree-Shaped Tableau for LTL A one-pass tree-shaped tableau method for LTL satisfiability was recently proposed Purely tree-shaped rule-based search procedure. A single pass is suffjcient to determine the acceptance of rejection of a given branch. Very simple set of rules, combining the simplicity of declarative tableaux with the effjciency of one-pass systems. Easy to extend . Easy to parallelize with huge speedups. 8

  13. Example { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  14. Example { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  15. Example { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  16. Example { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  17. Example p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  18. Example p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  19. Example p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  20. Example p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  21. Example p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  22. Example p ¬ p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  23. Example p ¬ p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  24. Example p ¬ p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } 9

  25. Example p ¬ p p ¬ p { G F ( p ∧ X ¬ p ) } { F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } {¬ p , G F ( p ∧ X ¬ p ) } {¬ p , F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } {¬ p , p , X ¬ p , . . . } {¬ p , X F ( p ∧ X ¬ p ) , X G F ( p ∧ X ¬ p ) } ✗ { F ( p ∧ X ¬ p ) , G F ( p ∧ X ¬ p ) } . . . { p , X ¬ p , X G F ( p ∧ X ¬ p ) } ✓ 9

  26. Example - unsatisfiable formula { G ¬ p ∧ q U p } { G ¬ p , q U p } {¬ p , X G ¬ p , p } {¬ p , X G ¬ p , q , X ( q U p ) } { G ¬ p , q U p } {¬ p , X G ¬ p , p } {¬ p , X G ¬ p , q , X ( q U p ) } ✗ { G ¬ p , q U p } {¬ p , X G ¬ p , p } {¬ p , X G ¬ p , q , X ( q U p ) } ✗ 10

  27. Example - unsatisfiable formula { G ¬ p ∧ q U p } { G ¬ p , q U p } {¬ p , X G ¬ p , p } {¬ p , X G ¬ p , q , X ( q U p ) } { G ¬ p , q U p } {¬ p , X G ¬ p , p } {¬ p , X G ¬ p , q , X ( q U p ) } ✗ { G ¬ p , q U p } {¬ p , X G ¬ p , p } {¬ p , X G ¬ p , q , X ( q U p ) } ✗ 10

Recommend

Tableau-based decision method for testing satisfiability of the linear temporal logic LTL

Tableau-based decision method for testing satisfiability of the linear temporal logic LTL

Tableau-based decision method for testing satisfiability of the linear temporal logic LTL Valentin Goranko DTU Informatics November 2010 V Goranko Tableau for LTL: introduction The tableau method for LTL searches systematically for a linear

629 views • 48 slides
CSAT ( ALC ) is in NExpTime (tableau algorithm is non-deterministic, builds c-tree of linear

CSAT ( ALC ) is in NExpTime (tableau algorithm is non-deterministic, builds c-tree of linear

4. Complexity of selected DLs So far: upper complexity bounds for the satisfiability of: CSAT ( ALC ) is in NExpTime (tableau algorithm is non-deterministic, builds c-tree of linear depth) SAT ( ALCQI ) w.r.t. TBoxes is in 2NExpTime

523 views • 24 slides
Advanced Logic Linear Temporal Logic Computation Tree Logic Daniel Gebler VU University

Advanced Logic Linear Temporal Logic Computation Tree Logic Daniel Gebler VU University

Advanced Logic Linear Temporal Logic Computation Tree Logic Daniel Gebler VU University Amsterdam March 11, 2013 Overview Linear temporal logic (LTL): describes properties of paths (individual executions) no modalities to

1.26k views • 107 slides
Overview Word Systems Regular expressiveness Linear temporal logic B uchi-automata

Overview Word Systems Regular expressiveness Linear temporal logic B uchi-automata

ormal ethods roup Linear Temporal Logics and Grammars Joachim Baran The University of Manchester April 2006 Overview Word Systems Regular expressiveness Linear temporal logic B uchi-automata Right-linear grammars TL,

512 views • 33 slides
MIMD Multicomputer Mesh, ring, linear array, 2D-torus, 3D-mesh 3D-torus, tree fat tree,

MIMD Multicomputer Mesh, ring, linear array, 2D-torus, 3D-mesh 3D-torus, tree fat tree,

MIMD Multicomputer Mesh, ring, linear array, 2D-torus, 3D-mesh 3D-torus, tree fat tree, hypercube, star, vulcan switch, cube connected cycl omega, crossbar, M M M P P P etc, ...... M M Lecture 6: P P Network (mess.pass) MIMD

456 views • 8 slides
Overview overview7.5 Introduction Modelling parallel systems Linear Time Properties Regular

Overview overview7.5 Introduction Modelling parallel systems Linear Time Properties Regular

Overview overview7.5 Introduction Modelling parallel systems Linear Time Properties Regular Properties Linear Temporal Logic (LTL) Computation-Tree Logic Equivalences and Abstraction bisimulation CTL, CTL*-equivalence computing the

2.06k views • 183 slides
Overview overview7.4 Introduction Modelling parallel systems Linear Time Properties Regular

Overview overview7.4 Introduction Modelling parallel systems Linear Time Properties Regular

Overview overview7.4 Introduction Modelling parallel systems Linear Time Properties Regular Properties Linear Temporal Logic (LTL) Computation-Tree Logic Equivalences and Abstraction bisimulation CTL, CTL*-equivalence computing the

1.95k views • 194 slides
Tree Recursion Tree Recursion Tree-shaped processes arise whenever executing the body of a

Tree Recursion Tree Recursion Tree-shaped processes arise whenever executing the body of a

Tree Recursion Tree Recursion Tree-shaped processes arise whenever executing the body of a recursive function makes more than one recursive call n: 0, 1, 2, 3, 4, 5, 6, 7, 8, ... , 35 fib(n): 0, 1, 1, 2, 3, 5, 8, 13, 21, ... ,

289 views • 12 slides
Tableau Proofs. Preliminaries S with a binary relation (less than, written < , on S which

Tableau Proofs. Preliminaries S with a binary relation (less than, written < , on S which

Spring 2009 IA008 Computational Logic Tableau Proofs Tableau Proofs. Preliminaries S with a binary relation (less than, written < , on S which is transitive and irreflexive . A partial order ... a set T is infinite, it has an A tree K

473 views • 15 slides
A tableau-based decision procedure for a branching-time interval temporal logic Davide Bresolin

A tableau-based decision procedure for a branching-time interval temporal logic Davide Bresolin

A tableau-based decision procedure for a branching-time interval temporal logic Davide Bresolin Angelo Montanari Dipartimento di Matematica e Informatica Universit degli Studi di Udine { bresolin, montana } @dimi.uniud.it M4M-4, 1-2 December

578 views • 38 slides
61A Lecture 21 Monday, October 15 Tree Recursion Tree-shaped processes arise whenever executing

61A Lecture 21 Monday, October 15 Tree Recursion Tree-shaped processes arise whenever executing

61A Lecture 21 Monday, October 15 Tree Recursion Tree-shaped processes arise whenever executing the body of a function entails making more than one call to that function. n: 1, 2, 3, 4, 5, 6, 7, 8, 9, ... , 35 fib(n): 0, 1, 1, 2,

505 views • 9 slides
Linear Temporal Logic for Hyperproperties (HyperLTL) Course: Specification and Verification of

Linear Temporal Logic for Hyperproperties (HyperLTL) Course: Specification and Verification of

Linear Temporal Logic for Hyperproperties (HyperLTL) Course: Specification and Verification of Parallel Systems 29 November 2019 Presented by: Elahe Fazeldehkordi 1 Hyperproperties Trace: a sequence of states System: is modeled by

546 views • 13 slides
A Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: an

A Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: an

A Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: an Implementation TABLEAUX-2013 Davide Bresolin, Dario Della Monica, Angelo Montanari and Guido Sciavicco University of Verona - Italy, Reykjavik University

882 views • 72 slides
Formal Verifjcation Lecture 2: Linear Temporal Logic Jacques Fleuriot jdf@inf.ed.ac.uk Recap

Formal Verifjcation Lecture 2: Linear Temporal Logic Jacques Fleuriot jdf@inf.ed.ac.uk Recap

Formal Verifjcation Lecture 2: Linear Temporal Logic Jacques Fleuriot jdf@inf.ed.ac.uk Recap Previously: Model Checking, and an informal introduction to LTL Tiis time: Linear Temporal Logic Syntax Semantics Equivalences

228 views • 21 slides
Analytics Open Labs: Introduction to Tableau at the University of Kentucky 1 pm - 3 pm 1st

Analytics Open Labs: Introduction to Tableau at the University of Kentucky 1 pm - 3 pm 1st

1 Analytics Open Labs: Introduction to Tableau at the University of Kentucky 1 pm - 3 pm 1st & 3rd Friday each month 2 Overview Introductions Tableau Tableau Server Tableau Desktop Resources on IRAA website

612 views • 27 slides
Trees Linear Vs non-linear data structures Types of binary trees Binary tree traversals

Trees Linear Vs non-linear data structures Types of binary trees Binary tree traversals

Trees Linear Vs non-linear data structures Types of binary trees Binary tree traversals Representations of a binary tree Binary tree ADT Binary search tree EECS 268 Programming II 1 Overview We have discussed linear

1.05k views • 76 slides
Agenda coming lectures ... Part I: Linear time temporal logic (LTL) Part II: Model checking LTL

Agenda coming lectures ... Part I: Linear time temporal logic (LTL) Part II: Model checking LTL

Linear and Branching Temporal Logics 1 Frits Vaandrager Institute for Computing and Information Sciences Radboud University Nijmegen fvaan@cs.ru.nl June 25, 2015 1 Based on slides Julien Schmaltz F. Vaandrager Temporal Logics Agenda coming

667 views • 35 slides
Programming in Linear Temporal Logic Correspondence Categorical Semantics for Restricted LTL

Programming in Linear Temporal Logic Correspondence Categorical Semantics for Restricted LTL

Programming in Linear Temporal Logic Wolfgang Jeltsch The Temporal CurryHoward Programming in Linear Temporal Logic Correspondence Categorical Semantics for Restricted LTL and FRP Wolfgang Jeltsch Hybrid Signals Functional Reactive

285 views • 25 slides
Another tree example Phylogenetic tree Patient 1 Plan Clone Phylogeny B C RFTA16 Om1

Another tree example Phylogenetic tree Patient 1 Plan Clone Phylogeny B C RFTA16 Om1

Another tree example Phylogenetic tree Patient 1 Plan Clone Phylogeny B C RFTA16 Om1 Tree ADT A E ROv1 SBwl D G Tree recursion F H I Tree traversal ROv2 SBwlE4 Search and score n Search runtime O(2 ) Pass message

311 views • 9 slides
Accessing Tableau Accessing Tableau Accessing Tableau Once Tableau access is approved:

Accessing Tableau Accessing Tableau Accessing Tableau Once Tableau access is approved:

Accessing Tableau Accessing Tableau Accessing Tableau Once Tableau access is approved: https://tableau.bham.ac.uk

173 views • 4 slides
Unit-7: Linear Temporal Logic B. Srivathsan Chennai Mathematical Institute NPTEL-course July -

Unit-7: Linear Temporal Logic B. Srivathsan Chennai Mathematical Institute NPTEL-course July -

Unit-7: Linear Temporal Logic B. Srivathsan Chennai Mathematical Institute NPTEL-course July - November 2015 1 / 13 Module 1: Introduction to LTL 2 / 13 Transition Systems + G, F, X, GF + NuSMV State-space Bchi Automata LTL CTL

591 views • 30 slides
Unit-7: Linear Temporal Logic B. Srivathsan Chennai Mathematical Institute NPTEL-course July -

Unit-7: Linear Temporal Logic B. Srivathsan Chennai Mathematical Institute NPTEL-course July -

Unit-7: Linear Temporal Logic B. Srivathsan Chennai Mathematical Institute NPTEL-course July - November 2015 1 / 13 Module 1: Introduction to LTL 2 / 13 Transition Systems + G, F, X, GF + NuSMV State-space Bchi Automata LTL CTL

1.25k views • 110 slides
Prerequisites - You have installed Tableau Desktop on your computer. Available here:

Prerequisites - You have installed Tableau Desktop on your computer. Available here:

DATA SCIENCE SUMMER SCHOOL @ UNI VIENNA TUTORIAL: TABLEAU Prerequisites - You have installed Tableau Desktop on your computer. Available here: http://www.tableau.com/academic/students - You have downloaded the data (athlete_events.csv)

165 views • 14 slides
INF5140 Specification and Verification of Parallel Systems Spring 2018 Institutt for

INF5140 Specification and Verification of Parallel Systems Spring 2018 Institutt for

INF5140 Specification and Verification of Parallel Systems Spring 2018 Institutt for informatikk, Universitetet i Oslo February 16, 2018 1 / 47 Linear-Time Temporal Logic (LTL) Introduction Temporal Logic? Temporal logic is the logic of

515 views • 47 slides

More recommend