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
37
views
12
references
Top references
cited by
11
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,744
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
other
Author(s):
Krishnendu Chatterjee
,
Andreas Gaiser
,
Jan Křetínský
Publication date
(Print):
2013
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
Genomic Prediction: Concepts, Benchmarks & Synthesis
Most cited references
12
Record
: found
Abstract
: not found
Conference Proceedings
: not found
The temporal logic of programs
Amir Pnueli
(1977)
0
comments
Cited
393
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
On the synthesis of an asynchronous reactive module
Amir Pnueli
,
Roni Rosner
(1989)
0
comments
Cited
54
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Optimizations for LTL Synthesis
Roderick Bloem
,
Barbara Jobstmann
(2006)
0
comments
Cited
24
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2013
Pages
: 559-575
DOI:
10.1007/978-3-642-39799-8_37
SO-VID:
d928e03b-f5fd-4b09-a3a8-aa4c3b5d960c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 85
Model-Checking Signal Transduction Networks through Decreasing Reachability Sets
pp. 191
Duet: Static Analysis for Unbounded Parallelism
pp. 364
Generating Non-linear Interpolants by Semidefinite Programming
pp. 107
Exploring Parameter Space of Stochastic Biochemical Systems Using Quantitative Model Checking
pp. 141
Partial Orders for Efficient Bounded Model Checking of Concurrent Software
pp. 174
Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
pp. 242
Exponential-Condition-Based Barrier Certificate Generation for Safety Verification of Hybrid Systems
pp. 264
Efficient Robust Monitoring for STL
pp. 313
Beautiful Interpolants
pp. 347
Disjunctive Interpolants for Horn-Clause Verification
pp. 413
Better Termination Proving through Cooperation
pp. 463
A Fully Verified Executable LTL Model Checker
pp. 527
Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties
pp. 559
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
pp. 576
Importance Splitting for Statistical Model Checking Rare Properties
pp. 640
Finite Model Finding in SMT
pp. 690
A Tool for Estimating Information Leakage
pp. 708
Lengths May Break Privacy – Or How to Check for Equivalences with Length
pp. 756
Effectively-Propositional Reasoning about Reachability in Linked Data Structures
pp. 773
Automating Separation Logic Using SMT
pp. 846
Automatic Abstraction in SMT-Based Unbounded Software Model Checking
pp. 863
DiVinE 3.0 – An Explicit-State Model Checker for Multithreaded C & C++ Programs
pp. 869
Solving Existentially Quantified Horn Clauses
pp. 928
PARTY Parameterized Synthesis of Token Rings
Similar content
5,744
Efficient Construction of Simultaneous Deterministic Finite Automata on Multicores Using Rabin Fingerprints
Authors:
Minyoung Jung
,
Bernd Burgstaller
,
Johann Blieberger
Resolving Rabin's Paradox
Authors:
H Bleichrodt
,
Jason Doctor
,
Y Gao
…
The Miller–Rabin test with randomized exponents
Authors:
Gebhard Böckle
See all similar
Cited by
11
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
Authors:
Tomáš Babiak
,
František Blahoudek
,
Mojmír Křetínský
…
The Hanoi Omega-Automata Format
Authors:
Tomáš Babiak
,
František Blahoudek
,
Alexandre Duret-Lutz
…
MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata
Authors:
Salomon Sickert
,
Jan Křetínský
See all cited by