Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
40
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
2,873
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
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
2,873
Variations on parallel explicit emptiness checks for generalized Büchi automata
Authors:
E. Renault
,
A. Duret-Lutz
,
F Kordon
…
Is there a best büchi automaton for explicit model checking?
Authors:
František Blahoudek
,
Alexandre Duret-Lutz
,
Mojmír Křetínský
…
Realizing an Aza Paternò–Büchi Reaction
Authors:
Elango Kumarasamy
,
Sunil Kandappa
,
Ramya Raghunathan
…
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