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
38
views
16
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
1,587
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Correct Hardware Design and Verification Methods
On Complementing Nondeterministic Büchi Automata
other
Author(s):
Sankar Gurumurthy
,
Orna Kupferman
,
Fabio Somenzi
,
Moshe Y. Vardi
Publication date
(Print):
2003
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
ScienceOpen Research
Most cited references
16
Record
: found
Abstract
: not found
Article
: not found
Alternation
Ashok K. Chandra
,
Dexter Kozen
,
Larry Stockmeyer
(1981)
0
comments
Cited
112
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Checking that finite state concurrent programs satisfy their linear specification
Amir Pnueli
,
Orna Lichtenstein
(1985)
0
comments
Cited
78
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The complementation problem for Büchi automata with applications to temporal logic
A. Sistla
,
Moshe Vardi
,
Pierre Wolper
(1987)
0
comments
Cited
64
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2003
Pages
: 96-110
DOI:
10.1007/978-3-540-39724-3_10
SO-VID:
b7ed75f8-84a7-4956-a225-3004ddae6962
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 81
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
pp. 96
On Complementing Nondeterministic Büchi Automata
pp. 126
“More Deterministic” vs. “Smaller” Büchi Automata for Efficient LTL Model Checking
pp. 247
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Similar content
1,587
Büchi's model based analysis of local anesthetic action in procaine hydrochloride: Vibrational spectroscopic approach
Authors:
V.S. Jayakumar
,
Y. Sheeba Sherlin
,
T. Vijayakumar
…
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids
Authors:
Zoltán Fülöp
,
Torsten Stüber
,
Heiko Vogler
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
Authors:
Nicolas Bousquet
,
Christof Löding
See all similar
Cited by
11
Antichain Algorithms for Finite Automata
Authors:
Laurent Doyen
,
Jean-François Raskin
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
Authors:
M. De Wulf
,
L Doyen
,
N. Maquet
…
The Büchi Complementation Saga
Authors:
Moshe Vardi
See all cited by