2017/03/01 by Yong Wang, Wang, Yong · 3 citations
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO
paper · pdf · doi:10.48550/arxiv.1703.00159
31 pages, 1 figures. arXiv admin note: substantial text overlap with arXiv:1611.09035
openalex publication_date 2017/03/01 · arxiv created 2020/04/22 · arxiv updated 2020/04/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruences for strongly and weakly truly concurrent bisimulations, and also unique solution for recursion.