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
29
views
7
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,731
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
SAT-Based Minimization of Deterministic \(\omega \) -Automata
other
Author(s):
Souheib Baarir
,
Alexandre Duret-Lutz
Publication date
(Online):
November 22 2015
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
Value-based Healthcare
Most cited references
7
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
Krishnendu Chatterjee
,
Andreas Gaiser
,
Jan Křetínský
(2013)
0
comments
Cited
11
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
Tomáš Babiak
,
František Blahoudek
,
Mojmír Křetínský
…
(2013)
0
comments
Cited
8
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
The Hanoi Omega-Automata Format
Tomáš Babiak
,
František Blahoudek
,
Alexandre Duret-Lutz
…
(2015)
0
comments
Cited
7
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2015
Publication date (Online):
November 22 2015
Pages
: 79-87
DOI:
10.1007/978-3-662-48899-7_6
SO-VID:
2302dc05-e916-40d4-99d7-6a3fcd38ccf9
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Skolemization for Substructural Logics
pp. 16
Reasoning About Embedded Dependencies Using Inclusion Dependencies
pp. 31
Cobra: A Tool for Solving General Deductive Games
pp. 48
On Anti-subsumptive Knowledge Enforcement
pp. 63
Value Sensitivity and Observable Abstract Values for Information Flow Control
pp. 79
SAT-Based Minimization of Deterministic $$\omega $$ -Automata
pp. 97
Decidability, Introduction Rules and Automata
pp. 112
Analyzing Internet Routing Security Using Model Checking
pp. 130
Boolean Formulas for the Static Identification of Injection Attacks in Java
pp. 178
Automated Benchmarking of Incremental SAT and QBF Solvers
pp. 203
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
pp. 219
TIP: Tools for Inductive Provers
pp. 233
Verification of Concurrent Programs Using Trace Abstraction Refinement
pp. 249
Synchronized Recursive Timed Automata
pp. 266
Focused Labeled Proof Systems for Modal Logic
pp. 281
On CTL* with Graded Path Modalities
pp. 297
On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control
pp. 313
On the Expressive Power of Communication Primitives in Parameterised Systems
pp. 329
There Is No Best $$\beta $$ -Normalization Strategy for Higher-Order Reasoners
pp. 340
Fine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors
pp. 356
Abstract Domains and Solvers for Sets Reasoning
pp. 372
Sharing HOL4 and HOL Light Proof Knowledge
Similar content
4,731
College-bound seniors: A profile of SAT program test takers
Authors:
College Board
The Effect of High School Socioeconomic Status on the Predictive Validity of SAT Scores and High School Grade-Point Average
Authors:
Rebecca Zwick
,
Igor Himelfarb
Comprehensive analysis and identification of drought-responsive candidate NAC genes in three semi-arid tropics (SAT) legume crops
Authors:
Sadhana Singh
,
Himabindu Kudapa
,
Vanika Garg
…
See all similar
Cited by
2
Self-adaptive Model Checking, the Next Step?
Authors:
Fabrice Kordon
,
Yann Thierry-Mieg
Minimization of Visibly Pushdown Automata Using Partial Max-SAT
Authors:
Matthias Heizmann
,
Christian Schilling
,
Daniel Tischner
See all cited by