Preview
Unable to display preview. Download preview PDF.
References
M. A. Bednarczyk, Categories of asynchronous systems, Ph. D. Thesis, University of Sussex (1987).
J. A. Bergstra, J. W. Klop, Algebra of communicating processes with abstraction, TCS 37 (1985) 77–121.
G. Berry, J.-J. Lévy, minimal and optimal computations of recursive programs, J. of ACM 26 (1979) 148–175.
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.
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.
G. Boudol, Flow event structures and flow nets, in this volume (1990).
G. Boudol, I. Castellani, On the semantics of concurrency: partial orders and transition systems, TAPSOFT 87, Lecture Notes in Comput. Sci. 249 (1987) 123–137.
G. Boudol, I. Castellani, Concurrency and atomicity, Theoretical Comput. Sci. 59 (1988) 25–84.
G. Boudol, I. Castellani, Permutation of transitions: an event structure semantics for CCS and SCCS, in Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Comput. Sci. 354 (1988) 411–427.
G. Boudol, I. Castellani, A non-interleaving semantic for CCS based on proved transitions, Fundamenta Informaticae XI (1988) 433–452.
G. Boudol, I. Castellani, Computations of distributed systems, Part 2: three equivalent semantics for CCS, full version of this paper, to appear as an INRIA report (1990).
S. Brookes, C. A. R. Hoare, A. Roscoe, A theory of communicating sequential processes, JACM 31 (1984) 560–599.
S. Brookes, W. C. Rounds, Behavioural equivalence relations induced by programming logics, ICALP 83, Lecture Notes in Comput. Sci. 154 (1983) 97–108.
I. Castellani, M. Hennessy, Distributed Bisimulations, JACM 36 (1989) 887–911.
I. Castellani, Bisimulations for concurrency, Ph. D. Thesis, University of Edinburgh, CST-51-88 (1988).
I. Castellani, G. Q. Zhang, Parallel product of event structures, INRIA Res. Rep. 1078 and DAIMI Rep. PB-285, Aarhus University (1989).
Ph. Darondeau, P. Degano, Causal trees, ICALP 89, Lecture Notes in Comput. Sci. 372 (1989) 234–248.
P. Degano, R. De Nicola, U. Montanari, Partial ordering derivations for CCS, FCT 85, Lecture Notes in Comput. Sci. 199 (1985) 520–533.
P. Degano, R. De Nicola, U. Montanari, Concurrent histories: a basis for observing distributed systems, J. of Computer and Systems Sciences 34 (1987) 422–461.
P. Degano, R. De Nicola, U. Montanari, On the consistency of “truly concurrent” operational and denotational semantics, LICS 88 (1988) 133–141.
P. Degano, R. De Nicola, U. Montanari, A distributed operational semantics for CCS based on condition/event systems, Acta Informatica 26 (1988) 59–91.
R. De Nicola, Extensional equivalences for transition systems, Acta Informatica 24 (1987) 211–237.
H. J. Genrich, K. Lautenbach, P. S. Thiagarajan, Elements of general net theory, in Net Theory and Applications (W. Brauer, Ed.) Lecture Notes in Comput. Sci. 84 (1980) 21–163.
R. van Glabbeek, F. Vaandrager, Petri net models for algebraic theories of concurrency, Proceedings PARLE Conference, Eindhoven, Lecture Notes in Comput. Sci. 259 (1987) 224–242.
R. van Glabbeek, U. Goltz, Equivalence notions for concurrent systems and refinement of actions, MFCS 89, Lecture Notes in Comput. Sci. 379 (1989) 237–248.
R. van Glabbeek, U. Goltz, Equivalence notions and refinement of actions for flow event structures, Draft (march1990).
U. Goltz, Building structured Petri nets, Arbeitspapiere der GMD 223 (1986).
U. Goltz, On representing CCS programs by finite Petri nets, MFCS 88, Lecture Notes in Comput. Sci. 324 (1988) 339–350.
U. Goltz, A. Mycroft, On the relationship of CCS and Petri nets, ICALP 84, Lecture Notes in Comput. Sci. 172 (1984) 196–208.
U. Goltz, R. Loogen, A non-interleaving semantic model for nondeterministic concurrent processes, Tech. Report 87-15, RWTH Aachen (1987).
G. L. Ferrari, U. Montanari, Towards the unification of models for concurrency, to appear in Proc. CAAP90, Lecture Notes in Comput. Sci. 431 (1990).
G. L. Ferrari, Unifying models of concurrency, Ph. D. Thesis, University of Pisa (1990).
M. Hennessy, An Algebraic Theory of Processes, MIT Press (1988).
M. Hennessy, Observing processes, in Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Comput. Sci. 354 (1988) 173–200.
G. Huet, J.-J. Lévy, Call-by-need computations in non-ambiguous linear term rewriting systems, IRIA-LABORIA Report 359 (1979).
M. Z. Kwiatkowska, Fairness for non-interleaving concurrency, Ph. D. Thesis, Department of Computing Studies, University of Leicester, Techn. Rep. 22 (1989).
J.-J. Lévy, Optimal reductions in the lambda calculus, in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin, J.R. Hindley, Eds), Academic Press (1980) 159–191.
A. Mazurkiewicz, Concurrent program schemes and their interpretations, Aarhus Workshop on Verification of Parallel Programs, Daimi PB-78, Aarhus University (1977).
A. Mazurkiewicz, Basic notions of trace theory, in Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Comput. Sci. 354 (1988) 285–363.
R. Milner, A Calculus of Communicating Systems, Lecture Notes in Comput. Sci. 92 (1980) reprinted in Report ECS-LFCS-86-7, Edinburgh University.
R. Milner, Communication and Concurrency, Prentice-Hall International Series in Computer Science (1989).
R. Milner, Operational and algebraic semantics of concurrent processes, LFCS Report ECS-LFCS-88-46, Edinburgh Univ. (1988).
M. Nielsen, G. Plotkin, G. Winskel, Petri nets, event structures and domains, Theoret. Comput. Sci. 13 (1981) 85–108.
M. Nielsen, G. Rozenberg, P. S. Thiagarajan, Elementary transition systems, presented at the 2nd Workshop on Concurrency and Compositionality, S. Miniato (1990).
E.-R. Olderog, Operational Petri net semantics for CCSP, Advances in Petri Nets 87, Lecture Notes in Comput. Sci. 266 (1987) 196–223.
C. A. Petri, Non-sequential processes, GMD-ISF Rep. 77-05 (1977).
G. Plotkin, A Structural approach to operational semantics, Daimi FN-19, Aarhus University (1981).
V. R. Pratt, Modelling concurrency with partial orders, Intern. J. of Parallel Programming 15 (1986) 33–71.
W. Reisig, Petri Nets: an Introduction, EATCS monographs, Springer Verlag (1985).
B. Rozoy, On distributed languages and models for distributed computation, presented at: 18ème Ecole de Printemps d'Informatique Théorique, La Roche-Posay (april1990).
M. W. Shields, Deterministic asynchronous automata, in: Formal Methods in Programming, North-Holland (1985).
E. W. Stark, Concurrent transition systems, Theoret. Comput. Sci. 64 (1989) 221–269.
D. Taubner, Finite representations of CCS and TCSP programs by automata and Petri nets, Lecture Notes in Comput. Sci. 369, Springer (1989).
P. S. Thiagarajan, G. Rozenberg, M. Nielsen, A relationship between the event structure and trace semantics of elementary net systems, Draft (1988).
F. Vaandrager, A simple definition for parallel composition of prime event structures, Tech. Rep. CS-R8903, CWI, Amsterdam (1989).
G. Winskel, Event structure semantics for CCS and related languages, Daimi PB-159, Aarhus University (1983) s.a. 9th ICALP, Lecture Notes in Comput. Sci. 140 (1982) 561–576.
G. Winskel, Categories of models for concurrency, Seminar on Concurrency, Lecture Notes in Comput. Sci. 197 (1985) 246–267.
G. Winskel, Event structures, Advances in Petri Nets 86, Lecture Notes in Comput. Sci. 255 (1987) 325–392.
G. Winskel, An introduction to event structures, in Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Comput. Sci. 354 (1988) 364–397.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Boudol, G., Castellani, I. (1990). Three equivalent semantics for CCS. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-53479-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53479-2
Online ISBN: 978-3-540-46897-4
eBook Packages: Springer Book Archive