🤖 AI Summary
This study investigates the fundamental relationship between computation and concurrency. Addressing the limitation of traditional models in uniformly characterizing communication behavior and semantic equivalence, we extend True Concurrency Automata (TCAs) to support general communication operations and develop a unified algebraic framework for language equivalence and strong/weak bisimulation. Our contributions are threefold: (1) We propose a generalized communication semantics for TCAs, lifting prior restrictions on synchronous interaction; (2) We establish sound, complete, and decidable axiomatizations for both language equivalence and bisimulation; (3) We rigorously formalize the behavioral structure and semantic hierarchy of concurrent computation. The resulting theory provides a more precise and expressive foundation for formal verification of concurrent programs, programming language design, and model checking.
📝 Abstract
We try to clarify the relationship between computation and concurrency. Base on the so-called truly concurrent automata, we introduce communication and more operators, and establish the algebras modulo language equivalence and bisimilarity.