42
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      CONCUR’99 Concurrency Theory 

      Computing Minimum and Maximum Reachability Times in Probabilistic Systems

      other
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references9

          • Record: found
          • Abstract: not found
          • Article: not found

          An Analysis of Stochastic Shortest Path Problems

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Model checking for a probabilistic branching time logic with fairness

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Bisimulation through probabilistic testing (preliminary report)

                Bookmark

                Author and book information

                Book Chapter
                1999
                April 19 2002
                : 66-81
                10.1007/3-540-48320-9_7
                90d51293-0185-43c0-af4b-6750e93430b6
                History

                Comments

                Comment on this book

                Book chapters

                Similar content5,547

                Cited by24