Truly Concurrent Process Algebra with Localities

Truly Concurrent Process Algebra with Localities

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...

Descripción completa

Detalles Bibliográficos
Autor principal: Wang, Yong (-)
Formato: Libro electrónico
Idioma:Inglés
Publicado: San Diego : Elsevier Science & Technology 2024.
Edición:1st ed
Materias:
Computer multitasking > Mathematics.
Algebra.
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009843329606719
Tabla de Contenidos:
  • Front Cover
  • Truly Concurrent Process Algebra With Localities
  • Copyright
  • Contents
  • 1 Introduction
  • 2 Background
  • 2.1 Operational semantics
  • 2.2 Proof techniques
  • 2.3 CTC
  • 2.4 APTC
  • 2.5 πtc
  • 3 Location-related bisimulation semantics for true concurrency
  • 3.1 Static location bisimulations
  • 3.2 Dynamic location bisimulations
  • 4 CTC with localities
  • 4.1 CTC with static localities
  • 4.1.1 Syntax and operational semantics
  • 4.1.2 Strong bisimulations
  • 4.1.3 Weak bisimulations
  • 4.2 CTC with dynamic localities
  • 5 APTC with localities
  • 5.1 APTC with static localities
  • 5.1.1 BATC with static localities
  • 5.1.2 APTC with static localities
  • 5.1.3 Recursion
  • 5.1.4 Abstraction
  • 5.2 APTC with dynamic localities
  • 6 πtc with localities
  • 6.1 Operational semantics
  • 6.2 πtc with static localities
  • 6.2.1 Syntax and operational semantics
  • 6.2.2 Strong bisimilarities
  • 6.2.3 Algebraic theory
  • 6.3 πtc with dynamic localities
  • 7 Probabilistic location-related bisimulation semantics for true concurrency
  • 7.1 Probabilistic static location bisimulations
  • 7.2 Probabilistic dynamic location bisimulations
  • 8 CTC with localities and probability
  • 8.1 CTC with probabilistic static localities
  • 8.1.1 Syntax and operational semantics
  • 8.1.2 Strong bisimulations
  • 8.1.3 Weak bisimulations
  • 8.2 CTC with probabilistic dynamic localities
  • 9 APTC with localities and probability
  • 9.1 APTC with probabilistic static localities
  • 9.1.1 BATC with probabilistic static localities
  • 9.1.2 APTC with probabilistic static localities
  • 9.1.3 Recursion
  • 9.1.4 Abstraction
  • 9.2 APTC with probabilistic dynamic localities
  • 10 πtc with localities and probability
  • 10.1 Operational semantics
  • 10.2 πtc with probabilistic static localities
  • 10.2.1 Syntax and operational semantics
  • 10.2.2 Strong bisimilarities.
  • 10.2.3 Algebraic theory
  • 10.3 πtc with probabilistic dynamic localities
  • 11 Reversible location-related bisimulation semantics for true concurrency
  • 11.1 Reversible static location bisimulations
  • 11.2 Reversible dynamic location bisimulations
  • 12 Reversible CTC with localities
  • 12.1 Reversible CTC with static localities
  • 12.1.1 Syntax and operational semantics
  • 12.1.2 Strong bisimulations
  • 12.1.3 Weak bisimulations
  • 12.2 Reversible CTC with dynamic localities
  • 13 Reversible APTC with localities
  • 13.1 Reversible APTC with static localities
  • 13.1.1 Reversible BATC with static localities
  • 13.1.2 Reversible APTC with static localities
  • 13.1.3 Recursion
  • 13.1.4 Abstraction
  • 13.2 Reversible APTC with dynamic localities
  • 14 Reversible πtc with localities
  • 14.1 Operational semantics
  • 14.2 Reversible πtc with static localities
  • 14.2.1 Syntax and operational semantics
  • 14.2.2 Strong bisimilarities
  • 14.2.3 Algebraic theory
  • 14.3 Reversible πtc with dynamic localities
  • 15 Location-related bisimulation semantics for true concurrency
  • 15.1 Static location bisimulations
  • 15.2 Dynamic location bisimulations
  • 16 CTC with localities and guards
  • 16.1 CTC with static localities and guards
  • 16.1.1 Syntax and operational semantics
  • 16.1.2 Strong bisimulations
  • 16.1.3 Weak bisimulations
  • 16.2 CTC with dynamic localities and guards
  • 17 APTC with localities and guards
  • 17.1 APTC with static localities and guards
  • 17.1.1 BATC with static localities and guards
  • 17.1.2 APTC with static localities and guards
  • 17.1.3 Recursion
  • 17.1.4 Abstraction
  • 17.2 APTC with dynamic localities and guards
  • 18 πtc with localities and guards
  • 18.1 Operational semantics
  • 18.2 πtc with static localities and guards
  • 18.2.1 Syntax and operational semantics
  • 18.2.2 Strong bisimilarities.
  • 18.2.3 Algebraic theory
  • 18.3 πtc with dynamic localities and guards
  • References
  • Index
  • Back Cover.

Ejemplares similares