  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, $\tau$ laws for weakly truly concurrent
bisimulations, and full congruences for strongly and weakly truly concurrent
bisimulations, and also unique solution for recursion.
