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
39
views
17
references
Top references
cited by
17
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,942
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Symmetry Reduction for Probabilistic Model Checking
other
Author(s):
Marta Kwiatkowska
,
Gethin Norman
,
David Parker
Publication date
(Print):
2006
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
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
Model Reduction of Parametrized Systems 2015
Most cited references
17
Record
: found
Abstract
: not found
Article
: not found
Probabilistic symbolic model checking with PRISM: a hybrid approach
Gethin Norman
,
David Parker
,
Marta Kwiatkowska
(2004)
0
comments
Cited
43
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Fast randomized consensus using shared memory
Maurice Herlihy
,
James Aspnes
(1990)
0
comments
Cited
34
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Exploiting symmetry in temporal logic model checking
S. Jha
,
R. Enders
,
T. Filkorn
…
(1996)
0
comments
Cited
27
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 234-248
DOI:
10.1007/11817963_23
SO-VID:
ef2bd9d8-b49e-4a5f-958b-89a5e841bf0a
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Formal Specifications on Industrial-Strength Code—From Myth to Reality
pp. 17
Antichains: A New Algorithm for Checking Universality of Finite Automata
pp. 31
Safraless Compositional Synthesis
pp. 45
Minimizing Generalized Büchi Automata
pp. 59
Ticc: A Tool for Interface Compatibility and Composition
pp. 63
FAST Extended Release
pp. 81
A Fast Linear-Arithmetic Solver for DPLL(T)
pp. 137
Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop
pp. 234
Symmetry Reduction for Probabilistic Model Checking
pp. 249
Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
pp. 278
DiVinE – A Tool for Distributed Verification
pp. 286
Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions
pp. 300
Model Checking Multithreaded Programs with Asynchronous Atomic Methods
pp. 358
Repair of Boolean Programs with an Application to C
pp. 372
Termination of Integer Linear Programs
pp. 386
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
pp. 401
Termination Analysis with Calling Context Graphs
pp. 415
Terminator: Beyond Safety
pp. 419
CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools
pp. 452
Lookahead Widening
pp. 475
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
pp. 517
Programs with Lists Are Counter Automata
Similar content
2,942
Reasoning with probabilistic and deterministic graphical models
Authors:
R Dechter
On fast probabilistic consensus in the Byzantine setting
Authors:
Serguei Popov
Establishing the criterion validity of the interRAI check-up self-report instrument
Authors:
L. Geffen
,
G. KELLY
,
S. Hogeveen
…
See all similar
Cited by
17
Statistical Model Checking for Cyber-Physical Systems
Authors:
Edmund M. Clarke
,
Paolo Zuliani
Three-Valued Abstraction for Continuous-Time Markov Chains
Authors:
Joost-Pieter Katoen
,
Daniel Klink
,
Martin Leucker
…
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
Authors:
Joost-Pieter Katoen
,
Tim Kemna
,
Ivan S. Zapreev
…
See all cited by