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
28
views
15
references
Top references
cited by
4
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,877
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Robustness of Structurally Equivalent Concurrent Parity Games
other
Author(s):
Krishnendu Chatterjee
Publication date
(Print):
2012
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
15
Record
: found
Abstract
: not found
Article
: not found
Stochastic Games
L Shapley
(1953)
0
comments
Cited
210
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
On the synthesis of a reactive module
R Rosner
,
A. Pnueli
(1989)
0
comments
Cited
145
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Classical Descriptive Set Theory
Alexander S. Kechris
(1995)
0
comments
Cited
88
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 270-285
DOI:
10.1007/978-3-642-28729-9_18
SO-VID:
55f84142-9c30-4006-8dd5-feb7f29e0f9c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Querying UML Class Diagrams
pp. 26
Bicategories of Concurrent Games
pp. 74
When Is a Container a Comonad?
pp. 89
Well-Pointed Coalgebras (Extended Abstract)
pp. 104
Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs
pp. 119
Applicative Bisimulations for Delimited-Control Operators
pp. 135
Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata
pp. 150
Improved Ramsey-Based Büchi Complementation
pp. 165
Extending ${\cal H}_1$ -Clauses with Path Disequalities
pp. 180
Brookes Is Relaxed, Almost!
pp. 195
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
pp. 210
Is It a “Good” Encoding of Mixed Choice?
pp. 225
Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
pp. 240
Narcissists Are Easy, Stepmothers Are Hard
pp. 255
On Nominal Regular Languages with Binders
pp. 270
Robustness of Structurally Equivalent Concurrent Parity Games
pp. 286
Subgame Perfection for Equilibria in Quantitative Reachability Games
pp. 316
Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators
pp. 331
On Distributability of Petri Nets
pp. 346
Functions as Session-Typed Processes
pp. 361
Deriving Bisimulation Congruences for Conditional Reactive Systems
pp. 376
First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time
pp. 391
Model Checking Languages of Data Words
pp. 406
Branching-Time Model Checking of Parametric One-Counter Automata
pp. 421
Synthesizing Probabilistic Composers
pp. 452
Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation
pp. 467
On the Complexity of the Equivalence Problem for Probabilistic Automata
Similar content
2,877
Parity nonconservation in neutron resonances in\({}^{232}\mathrm{Th}\)
Authors:
S. L. Stephenson
,
J. D. Bowman
,
B. Crawford
…
Maternal, fetal and neonatal risk factors for preterm birth in parity > 1
Authors:
A Hanif
,
T. Ashraf
,
MK Pervaiz
…
Phase Slips and Parity Jumps in Quantum Oscillations of Inverted InAs/GaSb Quantum Wells
Authors:
Matija Karalic
,
Christopher Mittag
,
Susanne Mueller
…
See all similar
Cited by
4
Faster Statistical Model Checking for Unbounded Temporal Properties
Authors:
,
,
…
Bidding Mechanisms in Graph Games
Authors:
Guy Avni
,
Thomas Henzinger
,
Đorđe Žikelić
On the Complexity of Reachability in Parametric Markov Decision Processes
Authors:
Tobias Winkler
,
Sebastian Junges
,
Guillermo Pérez
…
See all cited by