Models for Concurrency

[1]  Glynn Winskel,et al.  Deterministic Behavioural Models for Concurrency , 1993, MFCS.

[2]  Pierre Wolper,et al.  Partial-Order Methods for Temporal Verification , 1993, CONCUR.

[3]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[4]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[5]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[6]  Walter Vogler,et al.  Bisimulation and Action Refinement , 1991, Theor. Comput. Sci..

[7]  Anna Ingólfsdóttir,et al.  A Theory of Communicating Processes , 1993 .

[8]  Pierre-Louis Curien.  Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[9]  Rom Langerak,et al.  Bundle event structures: a non-interleaving semantics for LOTOS , 1992, FORTE.

[10]  G. Michele Pinna,et al.  On the Nature of Events , 1992, MFCS.

[11]  Madhavan Mukund,et al.  CCS, Locations and Asynchronous Transition Systems , 1992 .

[12]  Roberto Gorrieri,et al.  A hierarchy of system descriptions via atomic linear refinement , 1992, Fundam. Informaticae.

[13]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[14]  Grzegorz Rozenberg,et al.  Elementary Transition Systems , 1990, Theor. Comput. Sci..

[15]  P. S. Thiagarajan,et al.  Event Structures and Trace Monoids , 1991, Theor. Comput. Sci..

[16]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[17]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[18]  Bard Bloom,et al.  Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces , 1991, MFPS.

[19]  Gérard Boudol.  Flow Event Structures and Flow Nets , 1990, Semantics of Systems of Concurrent Processes.

[20]  Glynn Winskel,et al.  A Compositional Proof System on a Category of Labelled Transition Systems , 1989, Inf. Comput..

[21]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[22]  Wojciech Penczek,et al.  A Temporal Logic for Event Structures , 1990 .

[23]  Irène Guessarian.  Semantics of Systems of Concurrent Processes , 1990, Lecture Notes in Computer Science.

[24]  Madhavan Mukund,et al.  An Axiomatization of Event Structures , 1989, FSTTCS.

[25]  Wieslaw Zielonka.  Safe Executions of Recognizable Trace Languages by Asynchronous Automata , 1989, Logic at Botik.

[26]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[27]  José Meseguer,et al.  Petri nets are monoids: a new algebraic foundation for net theory , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[28]  Rocco De Nicola,et al.  On the consistency of 'truly concurrent' operational and denotational semantics , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[29]  Glynn Winskel,et al.  A category of labelled Petri nets and compositional proof system , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[30]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

[31]  Doron A. Peled,et al.  An efficient verification method for parallel and distributed programs , 1988, REX Workshop.

[32]  Ilaria Castellani,et al.  A non-interleaving semantics for CCS based on proved transitions , 1988 .

[33]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[34]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[35]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[36]  Rocco De Nicola,et al.  Observational equivalences for concurrency models , 1987, Formal Description of Programming Concepts.

[37]  Grzegorz Rozenberg,et al.  Behaviour of Elementary Net Systems , 1986, Advances in Petri Nets.

[38]  P. S. Thiagarajan,et al.  Elementary Net Systems , 1986, Advances in Petri Nets.

[39]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[40]  Prakash Panangaden,et al.  Categorical Type Theory , 1985 .

[41]  Alberto Pettorossi,et al.  Categorical Models of Process Cooperation , 1985, CTCS.

[42]  Axel Poigné.  Category Theory and Logic , 1985, CTCS.

[43]  Wolfgang Reisig.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

[44]  Jean Benabou,et al.  Fibered categories and the foundations of naive category theory , 1985, Journal of Symbolic Logic.

[45]  M. W. Shields.  Concurrent Machines , 1985, Comput. J..

[46]  Edward Ochmanski,et al.  Regular behaviour of concurrent systems , 1985, Bull. EATCS.

[47]  Pierre Wolper,et al.  A temporal logic for reasoning about partially ordered computations (Extended Abstract) , 1984, PODC '84.

[48]  Glynn Winskel,et al.  Categories of Models for Concurrency , 1984, Seminar on Concurrency.

[49]  Stephen D. Brookes,et al.  On the Axiomatic Treatment of Concurrency , 1984, Seminar on Concurrency.

[50]  Stephen D. Brookes,et al.  On the Relationship of CCS and CSP , 1983, ICALP.

[51]  Jan A. Bergstra,et al.  Process algebra for communication and mutual exclusion , 1983 .

[52]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[53]  Glynn Winskel,et al.  A representation of completely distributive algebraic lattices , 1983 .

[54]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[55]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

[56]  D. Scott.  Domains for Denotational Semantics , 1982, ICALP.

[57]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[58]  Glynn Winskel,et al.  Events in computation , 1980 .

[59]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[60]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[61]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[62]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[63]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .