Reachability

Results: 243



#Item
41Anonymized Reachability of Hybrid Automata Networks Taylor T. Johnson1 and Sayan Mitra2 1 2

Anonymized Reachability of Hybrid Automata Networks Taylor T. Johnson1 and Sayan Mitra2 1 2

Add to Reading List

Source URL: www.taylortjohnson.com

- Date: 2014-06-24 09:47:42
    42Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games? Aleksandra Jovanovi´c, Didier Lime, Olivier H. Roux ´ LUNAM Universit´e. Ecole Centrale de Nantes - IRCCyN UMR CNRS 6597

    Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games? Aleksandra Jovanovi´c, Didier Lime, Olivier H. Roux ´ LUNAM Universit´e. Ecole Centrale de Nantes - IRCCyN UMR CNRS 6597

    Add to Reading List

    Source URL: www.irccyn.ec-nantes.fr

    - Date: 2013-12-09 09:54:25
      43A Formalised Lower Bound on Undirected Graph Reachability Ulrich Sch¨opp Ludwig-Maximilians-Universit¨at M¨unchen Oettingenstraße 67, DM¨unchen, Germany Abstract. We study the expressivity of Jumping Automata

      A Formalised Lower Bound on Undirected Graph Reachability Ulrich Sch¨opp Ludwig-Maximilians-Universit¨at M¨unchen Oettingenstraße 67, DM¨unchen, Germany Abstract. We study the expressivity of Jumping Automata

      Add to Reading List

      Source URL: www2.tcs.ifi.lmu.de

      - Date: 2008-06-17 10:01:28
        44Local Checkability, No Strings Attached:I (A)cyclicity, Reachability, Loop Free Updates in SDNs Klaus-Tycho Foerstera,b , Thomas Luedia , Jochen Seidela , Roger Wattenhofera a ETH b Microsoft

        Local Checkability, No Strings Attached:I (A)cyclicity, Reachability, Loop Free Updates in SDNs Klaus-Tycho Foerstera,b , Thomas Luedia , Jochen Seidela , Roger Wattenhofera a ETH b Microsoft

        Add to Reading List

        Source URL: www.tik.ee.ethz.ch

        - Date: 2016-11-30 19:43:04
          45Reachability in MDPs: Refining Convergence of Value Iteration Serge Haddad and Benjamin Monmege July 2014

          Reachability in MDPs: Refining Convergence of Value Iteration Serge Haddad and Benjamin Monmege July 2014

          Add to Reading List

          Source URL: www.lsv.ens-cachan.fr

          - Date: 2014-07-17 17:45:06
            46Switching Logic Synthesis for Reachability∗ Ankur Taly Ashish Tiwari Computer Science Dept., Stanford University

            Switching Logic Synthesis for Reachability∗ Ankur Taly Ashish Tiwari Computer Science Dept., Stanford University

            Add to Reading List

            Source URL: theory.stanford.edu

            - Date: 2011-03-08 18:45:54
              47Robust Reachability in Timed Automata and Games: A Game-based Approach I Patricia Bouyera , Nicolas Markeya , Ocan Sankurb a LSV, CNRS & ENS Cachan, Cachan, France.

              Robust Reachability in Timed Automata and Games: A Game-based Approach I Patricia Bouyera , Nicolas Markeya , Ocan Sankurb a LSV, CNRS & ENS Cachan, Cachan, France.

              Add to Reading List

              Source URL: www.lsv.ens-cachan.fr

              - Date: 2014-08-25 11:21:22
                48Size-Estimation Framework with Applications to Transitive Closure and Reachability∗ Edith Cohen AT&T Bell Laboratories Murray Hill, NJ 07974

                Size-Estimation Framework with Applications to Transitive Closure and Reachability∗ Edith Cohen AT&T Bell Laboratories Murray Hill, NJ 07974

                Add to Reading List

                Source URL: cohenwang.com

                - Date: 2013-09-17 19:00:40
                  49Computing Laboratory EXPECTED REACHABILITY-TIME GAMES Vojtˇech Forejt1 Marta Kwiatkowska2

                  Computing Laboratory EXPECTED REACHABILITY-TIME GAMES Vojtˇech Forejt1 Marta Kwiatkowska2

                  Add to Reading List

                  Source URL: www.prismmodelchecker.org

                  - Date: 2012-05-10 09:21:57
                    50Pointer Programs and Undirected Reachability∗ Ulrich Sch¨opp† Martin Hofmann‡ January 16, 2009

                    Pointer Programs and Undirected Reachability∗ Ulrich Sch¨opp† Martin Hofmann‡ January 16, 2009

                    Add to Reading List

                    Source URL: www2.tcs.ifi.lmu.de

                    - Date: 2009-01-16 11:26:01