A Relational Model of Non-Deterministic Dataflow (1998)

by Thomas T. Hildebrandt , Prakash Panangaden , Glynn Winskel
Venue:In CONCUR'98, volume 1466 of LNCS
Citations:27 - 13 self

Documents Related by Co-Citation

116 Bisimulation from Open Maps – André Joyal, Mogens Nielsen, Mogens Nielsen, Glynn Winskel, Glynn Winskel - 1994
786 The semantics of a simple language for parallel programming – G Kahn - 1974
45 Presheaf Models for Concurrency – Gian Luca Cattani - 1999
106 Scenarios: A model of non-determinate computation,” in – J D Brock, W B Ackerman - 1981
263 Relations in Concurrency – Glynn Winskel
1330 A Calculus of Communicating Systems – R Milner - 1980
3219 Communication and Concurrency – R Milner - 1990
170 Traced monoidal categories – André Joyal, Ross Street, Domnic Verity - 1996
23 Domain theory for concurrency – Mikkel Nygaard - 2003
170 G.: Petri nets, event structures and domains – M Nielsen, G Plotkin, Winskel - 1981
23 A Theory of Recursive Domains with Applications to Concurrency – Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel - 1997
930 Categories for the Working Mathematician – S Mac Lane - 1971
394 Category Theory for Computing Science – Michael Barr, Charles Wells - 1990
210 A powerdomain construction – G. D. Plotkin - 1976
312 Calculi for synchrony and asynchrony – R Milner - 1983
45 Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi – Masahito Hasegawa - 1997
12 Profunctors, open maps and bisimulation – Gian Luca Cattani, Glynn Winskel - 2000
58 Events in Security Protocols – Federico Crazzolara , Glynn Winskel - 2001
33 A Presheaf Semantics of Value-Passing Processes – Glynn Winskel, Glynn Winskel - 1996