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
27
views
0
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
2,170
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
CONCUR 2000 — Concurrency Theory
other
Editor(s):
Catuscia Palamidessi
Publication date
(Online):
December 21 2000
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH doi match)
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
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Author and book information
Book
ISBN (Print):
978-3-540-67897-7
ISBN (Electronic):
978-3-540-44618-7
Publication date (Print):
2000
Publication date (Online):
December 21 2000
DOI:
10.1007/3-540-44618-4
SO-VID:
a927f779-1a43-458e-85ec-2e01c2061bfb
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 410
LP Deadlock Checking Using Partial Order Dependencies
pp. 123
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
pp. 138
The Impressive Power of Stopwatches
pp. 153
Optimizing Büchi Automata
pp. 168
Generalized Model Checking: Reasoning about Partial State Spaces
pp. 243
Deriving Bisimulation Congruences for Reactive Systems
pp. 334
Weak Bisimulation for Probabilistic Systems
pp. 350
Nondeterminism and Probabilistic Choice: Obeying the Laws
pp. 380
On the Reachability Problem in Cryptographic Protocols
Similar content
2,170
CONCUR 2004 - Concurrency Theory
Authors:
P.-A. Melliès
CONCUR—concurrency theory, 20th international conference, vol 5710 in Lecture Notes in Computer Science
Authors:
R Meyer
CONCUR ’96: Concurrency Theory
Authors:
O. Kupferman
See all similar
Cited by
5
The Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes
Authors:
Marco Bernardo
,
Michele Loreti
,
Rocco De Nicola
Industrial Strength Formal Using Abstractions
Authors:
Ashish Darbari
,
Iain Singleton
An intensionally fully-abstract sheaf model for \(\pi\) (expanded version)
Authors:
Thomas Seiller
,
Clovis Eberhart
,
Tom Hirschowitz
See all cited by