Journal of the ACM Bibliography

Selected papers that cite this one

• Samson Abramsky and Steven Vickers. Quantales, observational logic and process semantics. Mathematical Structures in Computer Science, 3(2):161-227, June 1993.

• L. Aceto and M. Hennessy. Termination, deadlock, and divergence. Journal of the ACM, 39(1):147-187, January 1992.

• L. Aceto and M. Hennessy. Towards action-refinement in process algebras. Information and Computation, 103(2):204-269, April 1993.

• L. Aceto and M. Hennessy. Adding action refinement to a finite process algebra. Information and Computation, 115(2):179-247, December 1994.

• Luca Aceto and Anna Ingólfsdóttir. CPO models for compact GSOS languages. Information and Computation, 129(2):107-141, 15 September 1996.

• J. C. M. Baeten and J. A. Bergstra. Process algebra with propositional signals. Theoretical Computer Science, 177(2):381-405, 15 May 1997.

• J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM, 40(3):653-682, July 1993.

• Albert Benveniste, Paul Le Guernic, and Christian Jacquemot. Synchronous programming with events and relations: the SIGNAL language and its semantics. Science of Computer Programming, 16(2):103-149, September 1991.

• Jan A. Bergstra and Alban Ponse. Kleene's three-valued logic and process algebra. Information Processing Letters, 67(2):95-103, 30 July 1998.

• Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232-268, January 1995.

• Michele Boreale, Rocco De Nicola, and Rosario Pugliese. Basic observables for processes. Accepted for publication in Information and Computation. Final manuscript received for publication August 28, 1998, 1998.

• Gérard Boudol and Ilaria Castellani. Flow models of distributed computations: Three equivalent semantics for CCS. Information and Computation, 114(2):247-314, 1 November 1994.

• Robert Cori, Yves Métivier, and Wies{\l}aw Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106(2):159-202, October 1993.

• Mads Dam. Process-algebraic interpretations of positive linear and relevant logics. Journal of Logic and Computation, 4(6):939-973, December 1994.

• Pierpaolo Degano and Roberto Gorrieri. A causal operational semantics of action refinement. Information and Computation, 122(1):97-119, October 1995.

• Jaana Eloranta, Martti Tienari, and Antti Valmari. Essential transitions to bisimulation equivalences. Theoretical Computer Science, 179(1-2):397-419, 1 June 1997.

• Hakan Erdogmus, Robert Johnson, and Michael Ferguson. On the operational semantics of nondeterminism and divergence. Theoretical Computer Science, 159(2):271-317, 3 June 1996.

• R. J. van Glabbeek. Notes on the methodology of CCS and CSP. Theoretical Computer Science, 177(2):329-349, 15 May 1997.

• Rob J. van Glabbeek and W. Peter Weijland. Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555-600, May 1996.

• Jan Friso Groote and Hans Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):354-371, December 1994.

• Eiichi Horita, J. W. de Bakker, and J. J. M. M. Rutten. Fully abstract denotational models for nonuniform concurrent languages. Information and Computation, 115(1):125-178, 15 November 1994.

• Dung T. Huynh and Lu Tian. On deciding readiness and failure equivalences for processes. Information and Computation, 117(2):193-205, March 1995.

• Lalita Jategaonkar and Albert R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science, 154(1):107-143, 22 January 1996.

• Bengt Jonsson and Joachim Parrow. Deciding bisimulation equivalences for a class of Non-Finite-State programs. Information and Computation, 107(2):272-302, December 1993.

• V. Natarajan and Rance Cleaveland. An algebraic theory of process efficiency. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 63-72, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.

• Sven-Olof Nyström and Bengt Jonsson. A fully abstract semantics for concurrent constraint programming. Information and Computation, 146(2):138-180, 1 November 1998.

• Joachim Parrow. Structural and behavioural equivalences of networks. Information and Computation, 107(1):58-90, November 1993.

• Alexander Rabinovich. Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation, 139(2):111-129, 15 December 1997.

• A. W. Roscoe. An alternative order for the failures model. Journal of Logic and Computation, 2(5):557-577, October 1992.

• Roberto Segala. Quiescence, fairness, testing, and the notion of implementation. Information and Computation, 138(2):194-210, 1 November 1997.

• Walter Vogler. Timed testing of concurrent systems. Information and Computation, 121(2):149-171, September 1995.

• J. L. M. Vrancken. The algebra of communicating processes with empty process. Theoretical Computer Science, 177(2):187-328, 15 May 1997.

Shortcuts: