• Contact

  • Newsletter

  • About us

  • Delivery options

  • News

  • 0
    Truly Concurrent Process Algebra With Localities

    Truly Concurrent Process Algebra With Localities by Wang, Yong;

      • GET 10% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice EUR 204.99
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        86 956 Ft (82 815 Ft + 5% VAT)
      • Discount 10% (cc. 8 696 Ft off)
      • Discounted price 78 260 Ft (74 534 Ft + 5% VAT)

    86 956 Ft

    db

    Availability

    printed on demand

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Long description:

    Truly Concurrent Process Algebra with Localities introduces localities into truly concurrent process algebras. The book explores all aspects of localities in truly concurrent process algebras, such as Calculus for True Concurrency (CTC), which is a generalization of CCS for true concurrency, Algebra of Parallelism for True Concurrency (APTC), which is a generalization of ACP for true concurrency, and ? Calculus for True Concurrency (?). Together, these approaches capture the so-called true concurrency based on truly concurrent bisimilarities, such as pomset bisimilarity, step bisimilarity, history-preserving (hp-) bisimilarity and hereditary history-preserving (hhp-) bisimilarity.

    This book provides readers with all aspects of algebraic theory for localities, including the basis of semantics, calculi for static localities, axiomatization for static localities, as well as calculi for dynamic localities and axiomatization for dynamic localities.

    More

    Table of Contents:

    1. Introduction
    2. Backgrounds
    3. Location-related Bisimulation Semantics for True Concurrency
    4. CTC with Localities
    5. APTC with Localities
    6. PItc with Localities
    7. Probabilistic Location-related Bisimulation Semantics for True Concurrency
    8. CTC with Localities and Probability
    9. APTC with Localities and Probability
    10. PItc with Localities and Probability
    11. Reversible Location-related Bisimulation Semantics for True Concurrency
    12. Reversible CTC with Localities
    13. Reversible APTC with Localities
    14. Reversible tc with Localities
    15. Location-related Bisimulation Semantics for True Concurrency
    16. CTC with Localities and Guards
    17. APTC with Localities and Guards
    18. PItc with Localities and Guards

    More