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
32
views
0
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,608
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Theoretical Computer Science
other
Editor(s):
Jos C. M. Baeten
,
Tom Ball
,
Frank S. de Boer
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
Digital Science
Author and book information
Book
ISBN (Print):
978-3-642-33474-0
ISBN (Electronic):
978-3-642-33475-7
Publication date (Print):
2012
DOI:
10.1007/978-3-642-33475-7
SO-VID:
ce53bfa0-e2ec-406a-96c1-5487c44e212b
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. E1
Erratum: Probabilistic Inference and Monadic Second Order Logic
pp. E2
Erratum: Cinderella versus the Wicked Stepmother
pp. 1
Computability and Non-computability Issues in Amorphous Computing
pp. 10
Static Single Information Form for Abstract Compilation
pp. 28
Input-Driven Stack Automata
pp. 43
Probabilistic Inference and Monadic Second Order Logic
pp. 57
Cinderella versus the Wicked Stepmother
pp. 72
Worst- and Average-Case Privacy Breaches in Randomization Mechanisms
pp. 87
Weak Bisimulations for Coalgebras over Ordered Functors
pp. 104
A Context-Free Linear Ordering with an Undecidable First-Order Theory
pp. 119
Open Bisimulation for Quantum Processes
pp. 134
A Modular LTS for Open Reactive Systems
pp. 149
Unidirectional Channel Systems Can Be Tested
pp. 164
On Properties and State Complexity of Deterministic State-Partition Automata
pp. 179
On Union-Free and Deterministic Union-Free Languages
pp. 193
A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
pp. 209
Formal Verification of Distributed Algorithms
pp. 225
A Temporal Logic for Multi-threaded Programs
pp. 240
The Algorithmic Complexity of k-Domatic Partition of Graphs
pp. 250
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
pp. 265
Modal Interface Automata
pp. 280
Proofs as Executions
pp. 295
Efficient Algorithms for the max k -vertex cover Problem
pp. 310
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words
pp. 325
Compositional Abstraction Techniques for Probabilistic Automata
pp. 342
Broadcast Abstraction in a Stochastic Calculus for Mobile Networks
pp. 357
An Intersection Type System for Deterministic Pushdown Automata
pp. 372
An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus
Similar content
1,608
The right tools for the job: At work in twentieth-century life sciences
Authors:
A. Clarke
,
JH Fujimura
,
Adele, Clarke
…
Optimal energy efficient path planning of UAV using hybrid MACO-MEA* algorithm: theoretical and experimental approach
Authors:
E. Balasubramanian
,
E. Elangovan
,
P. Tamilarasan
…
Examining the amine functionalization in dicarboxylates: photoelectron spectroscopy and theoretical studies of aspartate and glutamate.
Authors:
Shihu H M Deng
,
Gao-Lei Hou
,
Xiang-Yu Kong
…
See all similar
Cited by
2
On Learning Nominal Automata with Binders
Authors:
Yi Xiao
,
Emilio Tuosto
Solving Stochastic B\"uchi Games on Infinite Arenas with a Finite Attractor
Authors:
,
See all cited by