Concurrency can't be observed, asynchronously

[1]  Fabio Gadducci,et al.  On Barbs and Labels in Reactive Systems , 2010, SOS.

[2]  Fabio Gadducci,et al.  Encoding Asynchronous Interactions Using Open Petri Nets , 2009, CONCUR.

[3]  Ursula Goltz,et al.  Symmetric and Asymmetric Asynchronous Interaction , 2008, ICE@ICALP.

[4]  Daniele Gorla,et al.  Towards a unified approach to encodability and separation results for process calculi , 2008, Inf. Comput..

[5]  Frank D. Valencia,et al.  On the Asynchronous Nature of the Asynchronous pi-Calculus , 2008, Concurrency, Graphs and Models.

[6]  Doina Bucur,et al.  Secure Data Flow in a Calculus for Context Awareness , 2008, Concurrency, Graphs and Models.

[7]  Daniele Varacca,et al.  Compositional Event Structure Semantics for the Internal pi -Calculus , 2007, CONCUR.

[8]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[9]  Julian Rathke,et al.  Semantic Barbs and Biorthogonality , 2007, FoSSaCS.

[10]  Ivan Lanese,et al.  Concurrent and Located Synchronizations in pi-Calculus , 2007, SOFSEM.

[11]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[12]  Vladimiro Sassone,et al.  A Congruence for Petri Nets , 2005, PNGT@ICGT.

[13]  Reiko Heckel,et al.  Compositional semantics for open Petri nets based on deterministic processes , 2005, Mathematical Structures in Computer Science.

[14]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and asynchronous $pi$-calculi , 2003, Mathematical Structures in Computer Science.

[15]  Francesco Zappa Nardelli,et al.  Bisimulation Proof Methods for Mobile Ambients , 2003, ICALP.

[16]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[17]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[18]  Roberto Gorrieri,et al.  Comparing three semantics for Linda-like languages , 2000, Theor. Comput. Sci..

[19]  Cédric Fournet,et al.  A hierarchy of equivalences for asynchronous calculi , 1998, J. Log. Algebraic Methods Program..

[20]  Davide Sangiorgi,et al.  Some Congruence Properties for Pi-Calculus Bisimilarities , 1998, Theor. Comput. Sci..

[21]  Julian C. Bradfield,et al.  The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..

[22]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[23]  Peter Selinger,et al.  First-Order Axioms for Asynchrony , 1997, CONCUR.

[24]  Ekkart Kindler,et al.  A Compositional Partial Order Semantics for Petri Net Components , 1997, ICATPN.

[25]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

[26]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[27]  Roberto Gorrieri,et al.  A Petri Net Semantics for pi-Calculus , 1995, CONCUR.

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

[29]  Matthew Hennessy,et al.  Observing Localities , 1993, Theor. Comput. Sci..

[30]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[31]  Frank S. de Boer,et al.  Asynchronous communication in process algebra , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[32]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[33]  Pierre America,et al.  ECOOP'91 European Conference on Object-Oriented Programming , 1991, Lecture Notes in Computer Science.

[34]  R. V. Glabbeek.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[35]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[36]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[37]  Rocco De Nicola,et al.  Partial orderings descriptions and observations of nondeterministic concurrent processes , 1988, REX Workshop.

[38]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[39]  Jan A. Bergstra,et al.  Process Algebra with Asynchronous Communication Mechanisms , 1984, Seminar on Concurrency.

[40]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[41]  Franck van Breugel,et al.  Concur 2008 - Concurrency Theory , 2009 .

[42]  Wiebe van der Hoek,et al.  SOFSEM 2007: Theory and Practice of Computer Science , 2007 .

[43]  Roberto Bruni,et al.  Event Structure Semantics for Dynamic Graph Grammars , 2006, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[44]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[45]  Antoni Mazurkiewicz,et al.  CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.

[46]  Gianfranco Balbo,et al.  Application and Theory of Petri Nets 1997 , 1997 .

[47]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[48]  Marco Pistore,et al.  Concurrent Semantics for the π-calculus1 1Work supported in part by Esprit Basic Research project CONFER and working group COMPUGRAPH II and by Progetto Speciale CNR “Specifica ad Alto Livelloe Verifica Formale di Sistemi Digitali”. , 1995 .

[49]  Insup Lee,et al.  CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.

[50]  Andrzej Tarlecki,et al.  Mathematical Foundations of Computer Science 1991 , 1991, Lecture Notes in Computer Science.

[51]  Matthew Hennessy,et al.  Observing Localities (Extended Abstract) , 1991, MFCS.

[52]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[53]  Antoni Kreczmar,et al.  Mathematical Foundations of Computer Science 1989 , 1989, Lecture Notes in Computer Science.

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

[55]  A. J. Nijman,et al.  PARLE Parallel Architectures and Languages Europe , 1987, Lecture Notes in Computer Science.

[56]  Glynn Winskel,et al.  Seminar on Concurrency , 1984, Lecture Notes in Computer Science.