Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
24
views
9
references
Top references
cited by
15
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,606
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Towards Quantitative Verification of Probabilistic Transition Systems
other
Author(s):
Franck van Breugel
,
James Worrell
Publication date
(Online):
July 4 2001
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
Book Chapter
: not found
A categorical approach to probability theory
Michèle Giry
(1982)
0
comments
Cited
63
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Bisimulation for Labelled Markov Processes
Prakash Panangaden
,
Abbas Edalat
,
Josée Desharnais
(2002)
0
comments
Cited
51
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A probabilistic PDL
Dexter Kozen
(1985)
0
comments
Cited
33
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2001
Publication date (Online):
July 4 2001
Pages
: 421-432
DOI:
10.1007/3-540-48224-5_35
SO-VID:
0b21178b-7439-4574-8269-b0c2df94d11b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 24
Languages, Rewriting Systems, and Verification of Infinite-State Systems
pp. 201
Approximation Hardness of TSP with Bounded Metrics
pp. 64
Theoretical Aspects of Evolutionary Algorithms
pp. 249
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
pp. 261
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
pp. 273
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
pp. 370
Axiomatizations for Probabilistic Bisimulation
pp. 382
Noninterference for Concurrent Programs
pp. 396
Distributed Controller Synthesis for Local Specifications
pp. 421
Towards Quantitative Verification of Probabilistic Transition Systems
pp. 469
A New Method for Balancing Binary Search Trees
pp. 652
Model Checking of Unrestricted Hierarchical State Machines
pp. 667
Symbolic Trace Analysis of Cryptographic Protocols
pp. 694
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
pp. 708
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
pp. 757
Routing in Trees
pp. 797
Realizability and Verification of MSC Graphs
pp. 848
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
pp. 862
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
pp. 912
Information-Theoretic Private Information Retrieval: A Unified Construction
pp. 927
Secure Multiparty Computation of Approximations
pp. 1017
Time and Space Bounds for Reversible Simulation
Similar content
3,606
Synthesis, characterization, and biological verification of anti-HER2 indocyanine green–doxorubicin-loaded polyethyleneimine-coated perfluorocarbon double nanoemulsions for targeted photochemotherapy of breast cancer cells
Authors:
Yu-Hsiang Lee
,
Yun-Ting Ma
Randomized Batch Verification of Standard ECDSA Signatures
Authors:
Sabyasachi Karati
,
Abhijit Das
,
Dipanwita Roychoudhury
Set theory for verification. II: Induction and recursion
Authors:
Lawrence Paulson
See all similar
Cited by
15
A Behavioural Pseudometric for Metric Labelled Transition Systems
Authors:
Franck van Breugel
Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations
Authors:
Alessandro Abate
,
Marta Kwiatkowska
,
Gethin Norman
…
An Accessible Approach to Behavioural Pseudometrics
Authors:
Franck van Breugel
,
Claudio Hermida
,
Michael Makkai
…
See all cited by