Skip to main content

Multi-CCS

  • Chapter
  • 1210 Accesses

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

Abstract

We present Multi-CCS, an extension to CCS obtained by introducing one additional operator of prefixing, \(\underline{\alpha}.p\), called strong prefixing (as opposed to normal prefixing, \(\mu.p\)), with the capability of expressing atomic sequences of actions and, together with parallel composition, also multi-party synchronization.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Gorrieri, R., Versari, C. (2015). Multi-CCS. In: Introduction to Concurrency Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-21491-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21491-7_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21490-0

  • Online ISBN: 978-3-319-21491-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics