Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA

[1]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[2]  Petr Jancar.  Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

[3]  Faron Moller,et al.  Decidable Subsets of CCS , 1994, Comput. J..

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

[5]  Davide Sangiorgi,et al.  Environmental Bisimulations for Higher-Order Languages , 2007, LICS.

[6]  Damien Pous,et al.  A Distribution Law for CCS and a New Congruence Result for the pi-Calculus , 2007, FoSSaCS.

[7]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

[8]  Philippe Schnoebelen.  Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems , 2001, TACS.

[9]  Unique decomposition of processes , 1990, Bull. EATCS.

[10]  Maria Grazia Vigliotti,et al.  Symmetric electoral systems for ambient calculi , 2008, Inf. Comput..

[11]  Julian Rathke,et al.  Contextual equivalence for higher-order pi-calculus revisited , 2005, Log. Methods Comput. Sci..

[12]  Agostino Dovier,et al.  An efficient algorithm for computing bisimulation equivalence , 2004, Theor. Comput. Sci..

[13]  Davide Sangiorgi.  The Lazy Lambda Calculus in a Concurrency Scenario , 1994, Inf. Comput..

[14]  Bent Thomsen,et al.  Plain CHOCS A second generation calculus for higher order processes , 2005, Acta Informatica.

[15]  Douglas J. Howe.  Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..

[16]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .