This work has been partly supported by ESPRIT Basic Research Action 3011 CeDiSys.
Chapter PDF
References
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, Three equivalent semantics for CCS, this volume (1990).
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, A distributed operational semantics for CCS based on condition/event systems, Acta Informatica 26 (1988) 59–91.
P. Degano, R. De Nicola, U. Montanari, On the consistency of “truly concurrent” operational and denotational semantics, LICS 88 (1988) 133–141.
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.
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).
U. Goltz, On representing CCS programs by finite Petri nets, MFCS 88, Lecture Notes in Comput. Sci. 324 (1988) 339–350.
R. Milner, Communication and Concurrency, Prentice-Hall International Series in Computer Science (1989).
M. Nielsen, G. Plotkin, G. Winskel, Petri nets, event structures and domains, Theoret. Comput. Sci. 13 (1981) 85–108.
E.-R. Olderog, Operational Petri net semantics for CCSP, Advances in Petri Nets 87, Lecture Notes in Comput. Sci. 266 (1987) 196–223.
D. Taubner, Representing CCS programs by finite predicate/transition nets, Acta Informatica 27 (1990) 533–565.
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, 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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Boudol, G. (1990). Flow event structures and flow nets. 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_4
Download citation
DOI: https://doi.org/10.1007/3-540-53479-2_4
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