Truly Concurrent Process Algebra with Localities
Yong Wang

TL;DR
This paper introduces localities into truly concurrent process algebras, enhancing their ability to model true concurrency with a focus on local interactions, building upon existing truly concurrent algebra frameworks.
Contribution
It extends truly concurrent process algebras by incorporating localities, providing a more nuanced modeling of concurrent systems with local interactions.
Findings
Enhanced modeling of true concurrency with localities
Integration of locality concepts into existing truly concurrent algebras
Potential for more precise analysis of concurrent systems
Abstract
The well-known process algebras, such as CCS, ACP and -calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and , capture the true concurrency based on truly concurrent bisimilarities, such as pomset bisimilarity, step bisimilarity, history-preserving (hp-) bisimilarity and hereditary history-preserving (hhp-) bisimilarity. Truly concurrent process algebras are generalizations of the corresponding traditional process algebras. In this book, we introduce localities into truly concurrent process algebras, based on the work on process algebra with localities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Petri Nets in System Modeling · Business Process Modeling and Analysis
