SIGN IN
SIGN UP
A finite equational base for CCS with left merge and communication merge
Full Text:
Pdf
Buy this Article
Authors:
Luca Aceto
Reykjavík University, Reykjavik, Iceland
Wan Fokkink
Vrije Universiteit Amsterdam and CWI, Amsterdam, The Netherlands
Anna Ingolfsdottir
Reykjavík University, Reykjavik, Iceland
Bas Luttik
Technische Universiteit Eindhoven and CWI, Eindhoven, The Netherlands
2009 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 16
· Downloads (cumulative): 149
· Citation Count: 4
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL)
TOCL Homepage
archive
Volume 10 Issue 1, January 2009
Article No. 6
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1459010.1459016
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
alternation and nondeterminism
bisimilarity
ccs
communication merge
concurrency
finite equational base
handshaking
languages
left merge
parallel composition
parallelism and concurrency
process algebra
proof theory
semantics
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder