Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
32
views
20
references
Top references
cited by
5
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,621
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Model Checking Languages of Data Words
other
Author(s):
Benedikt Bollig
,
Aiswarya Cyriac
,
Paul Gastin
,
K. Narayan Kumar
Publication date
(Print):
2012
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
Exponential Random Graph Models
Most cited references
20
Record
: found
Abstract
: not found
Article
: not found
Finite-memory automata
Michael Kaminski
,
Nissim Francez
(1994)
0
comments
Cited
76
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Graph Rewriting: An Algebraic and Logic Approach
Bruno Courcelle
(1990)
0
comments
Cited
54
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Context-Bounded Analysis of Concurrent Queue Systems
Salvatore La Torre
,
P. Madhusudan
,
Gennaro Parlato
(2008)
0
comments
Cited
28
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 391-405
DOI:
10.1007/978-3-642-28729-9_26
SO-VID:
ed6d9f54-034c-44f0-9b86-708d641735bb
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
3,621
Neural correlates of processing valence and arousal in affective words
Authors:
PA Lewis
,
HD Critchley
,
P. Rotshtein
…
Word meaning and the control of eye fixation: semantic competitor effects and the visual world paradigm.
Authors:
Falk Huettig
,
Gerry T M Altmann
A real-word experience of eltrombopag plus rabbit antithymocyte immunoglobulin–based IST in Chinese patients with severe aplastic anemia
Authors:
Yuanyuan Jin
,
Ruixin Li
,
Shengyun Lin
…
See all similar
Cited by
5
A Fresh Approach to Learning Register Automata
Authors:
Benedikt Bollig
,
Peter Habermehl
,
Martin Leucker
…
Logics of Repeating Values on Data Trees and Branching Counter Systems
Authors:
Sergio Abriola
,
Diego Figueira
,
Santiago Figueira
On the Expressiveness of TPTL and MTL over \omega-Data Words
Authors:
Karin Quaas
,
Oliver Fernández Gil
,
Shiguang Feng
…
See all cited by