Decomposition orders—another generalisation of the fundamental theorem of arithmetic-Reference-Cited by-同舟云学术

Decomposition orders—another generalisation of the fundamental theorem of arithmetic

Published:2005-05 Issue:2-3 Volume:335 Page:147-186
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Luttik Bas,van Oostrom Vincent

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference28 articles.

1. Towards action-refinement in process algebras;Aceto;Inform. and Comput.,1993

2. Free sums of groups and their generalizations. An analysis of the associative law;Baer;Amer. J. Math.,1949

3. J.C.M. Baeten, R.J. van Glabbeek, Merge and termination in process algebra, in: K.V. Nori (Ed.), Proc. FST TCS 1987, Lecture Notes in Computer Science, Vol. 287, Springer, Berlin, 1987, pp. 153–172.

4. Process algebra for synchronous communication;Bergstra;Inform. and Control,1984

5. G. Birkhoff, Lattice theory, American Mathematical Society Colloquium Publications, Vol. XXV, third ed., American Mathematical Society, Providence, RI, 1967.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?;ACM Transactions on Computational Logic;2022-10-20

2. Unique Parallel Decomposition for the Pi-calculus;Electronic Proceedings in Theoretical Computer Science;2016-08-09

3. A procedure for splitting data-aware processes and its application to coordination;Science of Computer Programming;2016-01

4. On the existence and decidability of unique decompositions of processes in the applied π-calculus;Theoretical Computer Science;2016-01

5. Unique parallel decomposition in branching and weak bisimulation semantics;Theoretical Computer Science;2016-01