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
21
views
18
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
7,823
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Science Logic
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
other
Author(s):
Sven Schewe
,
Bernd Finkbeiner
Publication date
(Print):
2006
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
Renewable Energy – Distribution Grid
Most cited references
18
Record
: found
Abstract
: not found
Article
: not found
Reasoning about Infinite Computations
M.Y. Vardi
,
P. Wolper
(1994)
0
comments
Cited
40
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Alternating-time temporal logic
Rajeev Alur
,
Thomas Henzinger
,
Orna Kupferman
(2002)
0
comments
Cited
34
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Automata on Infinite Objects and Church’s Problem
Michael L. Rabin
(1972)
0
comments
Cited
30
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 591-605
DOI:
10.1007/11874683_39
SO-VID:
ff8e7689-4086-41ff-9d77-45a49d86b92f
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 591
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
pp. 167
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
pp. 287
Algorithms for Omega-Regular Games with Imperfect Information
pp. 334
First-Order Queries over One Unary Function
pp. 349
Infinite State Model-Checking of Propositional Dynamic Logics
pp. 395
Solving Games Without Determinization
pp. 562
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Similar content
7,823
Pu@C24: A New Example Satisfying the 32-Electron Principle
Authors:
Debashree Manna
,
Abhishek Sirohiwal
,
Tapan K. Ghanty
Basic Psychological Need‐Satisfying Activities during the COVID‐19 Outbreak
Authors:
Behzad Behzadnia
,
Saeideh FatahModares
Survival Distributions Satisfying Benford's Law
Authors:
Lawrence Leemis
,
Diane L. Evans
,
Bruce Schmeiser
See all similar
Cited by
9
Solving Parity Games in Big Steps
Authors:
Sven Schewe
Coordination Logic
Authors:
Bernd Finkbeiner
,
Sven Schewe
Tighter Bounds for the Determinisation of Büchi Automata
Authors:
Sven Schewe
See all cited by