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
24
views
24
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
2,631
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
CONCUR 2002 — Concurrency Theory
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
other
Author(s):
Stephen Brookes
Publication date
(Online):
September 18 2002
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
Efficacy of Communicating Science
Most cited references
24
Record
: found
Abstract
: not found
Book
: not found
A Calculus of Communicating Systems
Robin Milner
(1980)
0
comments
Cited
259
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Algebraic laws for nondeterminism and concurrency
Matthew Hennessy
,
Robin Milner
(1985)
0
comments
Cited
131
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Theory of Communicating Sequential Processes
S. D. Brookes
,
C. Hoare
,
A. W. Roscoe
(1984)
0
comments
Cited
114
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
September 18 2002
Pages
: 466-482
DOI:
10.1007/3-540-45694-5_31
SO-VID:
f9910e0c-237b-4b40-99d0-6f25abecb2f4
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 466
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
pp. 101
Network Invariants in Action*
pp. 116
Regular Model Checking Made Simple and Effcient*
pp. 145
A Decidable Class of Asynchronous Distributed Controllers
pp. 338
Simulation for Continuous-Time Markov Chains
pp. 355
Weak Bisimulation is Sound and Complete for PCTL*
pp. 594
Why Is Simulation Harder than Bisimulation?
Similar content
2,631
Teams can see pomsets
Authors:
G. Plotkin
,
Vaughan Pratt
An Algebra for Pomsets
Authors:
Stéphane Grumbach
,
Tova Milo
Pomset interpretations of parallel functional programs
Authors:
Paul Hudak
,
Steve Anderson
See all similar
Cited by
2
Models for Data-Flow Sequential Processes
Authors:
Mark B. Josephs
Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras
Authors:
Michael Laurence
,
Georg Struth
See all cited by