Reachability problem

Results: 18



#Item
1

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata Nathalie Bertrand1 , Thomas Brihaye2 , and Blaise Genest3 1 3

Add to Reading List

Source URL: people.rennes.inria.fr

Language: English - Date: 2016-01-18 08:43:29
    2Theoretical computer science / Mathematics / Finite automata / Computing / Theory of computation / Formal methods / Reachability problem / Logic in computer science / Model checking / Memory barrier / Preorder / Algorithm

    M EMORAX, a precise and sound tool for automatic fence insertion under TSO ? Parosh Aziz Abdulla1 , Mohamed Faouzi Atig1 , Yu-Fang Chen2 , Carl Leonardsson1 , and Ahmed Rezine3 1

    Add to Reading List

    Source URL: user.it.uu.se

    Language: English - Date: 2013-11-24 07:41:22
    3

    The Reachability Problem for Vector Addition Systems J´erˆ ome Leroux LaBRI (CNRS and University of Bordeaux), France. J´

    Add to Reading List

    Source URL: www.uet.vnu.edu.vn

    Language: English - Date: 2016-03-06 11:51:31
      4

      On the Decidability of the Reachability Problem for Planar Differential Inclusions ? E. Asarin ??

      Add to Reading List

      Source URL: www.liafa.jussieu.fr

      Language: English - Date: 2003-09-04 08:34:46
        5

        Reachability Analysis via Face Lifting? Thao Dang and Oded Maler Verimag, Centre Equation, 2, av. de Vignate, 38610 Gi eres, France, fThao.Dang, Abstract. In this paper we discuss the problem of calc

        Add to Reading List

        Source URL: www-verimag.imag.fr

        Language: English - Date: 2006-04-28 11:30:06
          6

          Reachability problem for weak multi-pushdown automata Wojciech Czerwi´nski, Piotr Hofman, and Sławomir Lasota? Institute of Informatics, University of Warsaw wczerwin,ph209519,

          Add to Reading List

          Source URL: www.mimuw.edu.pl

          Language: English - Date: 2012-08-06 16:28:45
            7

            A Lazy Reachability Algorithm for Timed Automata B. Srivathsan LaBRI, Universit´e Bordeaux 1 The reachability problem for timed automata refers to deciding if there exists

            Add to Reading List

            Source URL: www.cmi.ac.in

            Language: English - Date: 2010-12-23 06:40:11
              8

              Pushing the Boundaries of the Complexity of the Reachability Problem in Vector Addition Systems One Step at a Time Christoph Haase Laboratoire Spécification et Vérification (LSV), CNRS

              Add to Reading List

              Source URL: www.cmi.ac.in

              Language: English - Date: 2015-02-23 23:15:03
                9Network theory / Graph connectivity / Reachability / R-tree / Routing / Shortest path problem / Pruning / Distributed data storage / Bx-tree / Graph theory / Mathematics / Theoretical computer science

                iRoad: A Framework For Scalable Predictive Query Processing On Road Networks ∗ Abdeltawab M. Hendawi

                Add to Reading List

                Source URL: www-users.cs.umn.edu

                Language: English - Date: 2015-04-07 01:41:51
                10Mathematics / Combinatorics / Flow network / Dynamic programming / Maximum flow problem / Graph theory / Network flow / Operations research

                Specification Inference Using Context-Free Language Reachability Osbert Bastani Saswat Anand

                Add to Reading List

                Source URL: theory.stanford.edu

                Language: English - Date: 2015-02-24 02:42:36
                UPDATE