Advertisement

Processes as data types: Observational semantics and logic

  • Egidio Astesiano
  • Alessandro Giovini
  • Gianna Reggio
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 469)

Keywords

Label Transition System Inductive Rule Abstract Data Type Observational Structure Algebraic Specification 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [A]
    Abramsky S. “Observation Equivalence as a Testing Equivalence”, JTCS 53, 1987.Google Scholar
  2. [AD]
    Arnold A.; Dick A. “An Algebraic Characterization of Transition Systems Equivalences”, Information and Computation, Vol. 82, No. 2, August 1989, Academic Press.Google Scholar
  3. [AGR1]
    Astesiano E.; Giovini A.; Reggio G. “Generalized Bisimulation in Relational Specifications”, STACS '88, LNCS 294, 1988.Google Scholar
  4. [AGR2]
    Astesiano E.; Giovini A.; Reggio G. “Data in a Concurrent Environment”, Proc. of Concurrency '88, LNCS 335, 1988.Google Scholar
  5. [AGR3]
    Astesiano E.; Giovini A.; Reggio G. Observational Structures and their Logic, Internal Report, University of Genova, May 1990. Submitted for publication.Google Scholar
  6. [AR]
    Astesiano E.; Reggio G. “SMoLCS Driven Concurrent Calculi”, Proc. TAPSOFT`87, LNCS 249, 1987.Google Scholar
  7. [AW]
    Astesiano E.; Wirsing M. “Bisimulation in Algebraic Specifications”, Proc. of the Colloquium on Resolution of Equations in Algebraic Structures, San Diego, Academic Press, 1989.Google Scholar
  8. [C]
    Castellani I. “Bisimulation and abstraction homomorphisms”, J. Comp. System Sci. 34, 1987.Google Scholar
  9. [CH]
    Castellani I.; Hennessy M. “Distributed Bisimulations”, Journal of the ACM, October 1989, Vol. 36, n. 4, ACM, New York.Google Scholar
  10. [DH]
    De Nicola R.; Hennessy M. “Testing Equivalence for Processes”, JTCS 34, 1984.Google Scholar
  11. [DV]
    De Nicola R.; Vaandrager F. “Three logics for Branching Bisimulation”, to appear in Proc. of LICS `90.Google Scholar
  12. [FM]
    Ferrari G. L.; Montanari U. “Towards the Unification of Models for Concurrency”, Proc. CAAP '90, LNCS ???, 1990.Google Scholar
  13. [GR]
    Giovini A.; Reggio G. “Bisimulation Models in Algebraic Specifications”, Proc. of the Third Italian Conference on Theoretical Computer Science, World Scientific, 1989.Google Scholar
  14. [GM]
    Goguen J.; Meseguer J. “Models and Equality for Logical Programming”, Proc. of TAPSOFT '87, Berlin, Springer Verlag 1987, LNCS 250, 1987.Google Scholar
  15. [GV]
    Groote J. F.; Vaandrager F. “Structured Operational Semantics and Bisimulation as a Congruence” Proc. ICALP '89, LNCS 372, 1989.Google Scholar
  16. [GW]
    van Glabbeek R. J.; Weijland W. P. “Branching Time and Abstraction in Bisimulation Semantics”, Information Processing '89, North Holland, 1989.Google Scholar
  17. [HM]
    Hennessy M.; Milner R. “Algebraic Laws for Nondeterminism and Concurrency”, Journal of the ACM, Vol. 26, n. 1, ACM, New York, 1985.Google Scholar
  18. [M1]
    Milner R. “Calculi for Synchrony and Asynchrony”, JTCS 25, 1983.Google Scholar
  19. [M2]
    Milner R. Operational and Algebraic Semantics of Concurrent Processes, LFCS Report Series, Dept. of Computer Science, University of Edinburgh, ECS-LFCS-88–46, February 1988.Google Scholar
  20. [P]
    Park D. “Concurrency and Automata on Infinite Sequences”, Proc. 5th GI Conf., LNCS 104, 1981.Google Scholar
  21. [T]
    Thomsen B., “A Calculus of Higher-Order Communicating Systems”, Proc. POPL Conference, 1989.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Egidio Astesiano
    • 1
  • Alessandro Giovini
    • 1
  • Gianna Reggio
    • 1
  1. 1.Department of MathematicsUniversity of GenovaItaly

Personalised recommendations