Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
35
views
9
references
 Top references
cited by
24
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      4,255
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      CONCUR’99 Concurrency Theory 

      Computing Minimum and Maximum Reachability Times in Probabilistic Systems

      other
      Author(s):
      Publication date (Online):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      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

          Dimitri Bertsekas, John Tsitsiklis (1991)
          Article 0 comments Cited 81 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Model checking for a probabilistic branching time logic with fairness

            Christel Baier, Marta Kwiatkowska (1998)
            Article 0 comments Cited 33 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Bisimulation through probabilistic testing (preliminary report)

              K G Larsen, A. Skou (1989)
              Article 0 comments Cited 24 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 1999
                Publication date (Online): April 19 2002
                Pages: 66-81
                DOI: 10.1007/3-540-48320-9_7
                SO-VID: 90d51293-0185-43c0-af4b-6750e93430b6
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content4,255

                See all similar

                Cited by24

                See all cited by