ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
43
views
9
references
Top references
cited by
64
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,709
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
The complementation problem for Büchi automata with applications to temporal logic
Author(s):
A. Prasad Sistla
,
Moshe Y. Vardi
,
Pierre Wolper
Publication date
Created:
1987
Publication date
(Print):
1987
Journal:
Theoretical Computer Science
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
Further versions
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
Related collections
Applications of SAXS
Most cited references
9
Record
: found
Abstract
: not found
Article
: not found
Finite Automata and Their Decision Problems
M. Rabin
,
Richard D Scott
(1959)
0
comments
Cited
223
times
– based on
0
reviews
Review now
Record
: found
Abstract
: not found
Article
: not found
The complexity of propositional linear temporal logics
A. Sistla
,
E. Clarke
(1985)
0
comments
Cited
127
times
– based on
0
reviews
Review now
Record
: found
Abstract
: not found
Article
: not found
Temporal logic can be more expressive
Pierre Wolper
(1983)
0
comments
Cited
65
times
– based on
0
reviews
Review now
All references
Author and article information
Journal
Title:
Theoretical Computer Science
Abbreviated Title:
Theoretical Computer Science
Publisher:
Elsevier BV
ISSN (Print):
03043975
Publication date Created:
1987
Publication date (Print):
1987
Volume
: 49
Issue
: 2-3
Pages
: 217-237
Article
DOI:
10.1016/0304-3975(87)90008-9
SO-VID:
e4fd0516-045c-44a4-86ad-f947ace9b50f
Copyright ©
© 1987
License:
http://www.elsevier.com/tdm/userlicense/1.0/
History
Data availability:
Comments
Comment on this article
Sign in to comment
Related Documents Log
scite_
Similar content
2,709
Linear-Time Recognition of Connectivity of Binary Images on 1-bit Inter-Cell Communication Cellular Automata and Their Related Algorithms
Authors:
Hiroshi Umeo
Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata
Authors:
J Goldenberg
,
B Libai
,
E Müller
…
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata
Authors:
H. Todd Wareham
See all similar
Cited by
63
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
Authors:
Roy Armoni
,
Limor Fix
,
Alon Flaisher
…
Fair Simulation
Authors:
Thomas Henzinger
,
Sriram Rajamani
,
Orna Kupferman
Temporal Logics for Hyperproperties
Authors:
Michael Clarkson
,
Bernd Finkbeiner
,
Masoud Koleini
…
See all cited by
Most referenced authors
42
U. A. Meyer
D Meyer
R Meyer
See all reference authors