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
Sign in
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
Sign in
Register
Dashboard
Search
36
views
9
references
Top references
cited by
24
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,530
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):
Luca de Alfaro
Publication date
(Online):
April 19 2002
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
Socioecological systems
Most cited references
9
Record
: found
Abstract
: not found
Article
: not found
An Analysis of Stochastic Shortest Path Problems
Dimitri Bertsekas
,
John Tsitsiklis
(1991)
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)
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)
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
Sign in to comment
Book chapters
pp. 510
Weakest-Congruence Results for Livelock-Preserving Equivalences
pp. 46
Testing Concurrent Systems: A Formal Approach
pp. 66
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
pp. 114
Model Checking of Message Sequence Charts
pp. 146
Approximative Symbolic Model Checking of Continuous-Time Markov Chains
pp. 258
Metrics for Labeled Markov Systems
pp. 320
Rectangular Hybrid Games
pp. 431
Partial Order Reduction for Model Checking of Timed Automata
Similar content
3,530
Complexity reduction in explicit MPC: A reachability approach
Authors:
Michal Kvasnica
,
Peter Bakárač
,
Martin Klaučo
Using Reachable Sets for Trajectory Planning of Automated Vehicles
Authors:
Stefanie Manzinger
,
Christian Pek
,
Matthias Althoff
Efficient processing of label-constraint reachability queries in large graphs
Authors:
Lei Zou
,
Kun Xu
,
Jeffrey Xu Yu
…
See all similar
Cited by
24
Probabilistic symbolic model checking with PRISM: a hybrid approach
Authors:
Gethin Norman
,
David Parker
,
Marta Kwiatkowska
Performance analysis of probabilistic timed automata using digital clocks
Authors:
Jeremy Sproston
,
Gethin Norman
,
David Parker
…
Simple Stochastic Parity Games
Authors:
Krishnendu Chatterjee
,
Marcin Jurdzinski
,
Thomas Henzinger
See all cited by