Three equivalent semantics for CCS-Reference-Cited by-同舟云学术

Three equivalent semantics for CCS

Published:1990 Issue: Volume: Page:96-141
ISSN:0302-9743
Container-title:Semantics of Systems of Concurrent Processes
language:
Short-container-title:

Author:

Boudol Gérard,Castellani Ilaria

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-53479-2_5.pdf

Reference59 articles.

1. M. A. Bednarczyk, Categories of asynchronous systems, Ph. D. Thesis, University of Sussex (1987).

2. J. A. Bergstra, J. W. Klop, Algebra of communicating processes with abstraction, TCS 37 (1985) 77–121.

3. G. Berry, J.-J. Lévy, minimal and optimal computations of recursive programs, J. of ACM 26 (1979) 148–175.

4. E. Best, R. Devillers, Interleaving and partial orders in concurrency: a formal comparison, in Formal Description of Programming Concepts III, North-Holland (1987) 299–321.

5. G. Boudol, Computational semantics of term rewriting systems, in Algebraic Methods in Semantics (M. Nivat & J.C. Reynolds Eds), Cambridge University Press (1985) 169–236.

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

1. Concurrencies in Reversible Concurrent Calculi;Reversible Computation;2022

2. Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets;Application and Theory of Petri Nets and Concurrency;2015

3. A note on causal trees and their applications to CCS;International Journal of Computer Mathematics;1999-01

4. A categorical characterization of consistency results;Algebraic Methodology and Software Technology;1996

5. Trace nets and process automata;Acta Informatica;1995-07