Skip to main content
SpringerLink
Log in

Deriving failures models for nonuniform concurrency from structured operational semantics

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Semantic models are studied for concurrent languages which arenonuniform in that they involve individual variables which store values, and possible actions of an agent depend on its current state. First, an operational modelO L(O) based on afailures domain is defined from alabeled transition system L(T) which is in turn specified by a setT of rules for deriving transitions. A method is the introduced for deriving a denotational failures modelD T fromT whenT fits a certain syntactical format, called theNonuniform Non-Blocking Copy-Free SOS format (NU-NB-CF-SOS format), which is based on the format due to De Simone with certain additional restrictions specific to the nonuniform, setting. BothO L(O) andD T are constructed by applying the methodology of metric semantics, and the equivalence betweenD T andO L(T) is established by showing that bothO L(T) andD T are fixed-points of a higher-order mapping, which has a unique fixed-point by Banach’s fixed-point theorem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. de Bakker, J.W. and Rutten, J.J.M.M., “Concurrency Semantics Based on Metric Domain Equations,” inTopology and Category Theory in Computer Science (G.M. Reed, A.W. Roscoe, R.F. Wachter, eds.), Oxford University Press, pp. 113–152, 1991.

  2. de Bakker, J.W. and Rutten, J.J.M.M., eds.,Ten Years of Concurrency Semantics, World Scientific Publishing, Singapore, 1992.

    Google Scholar 

  3. de Bakker, J.W. and de Vink, E.P., “Rendez-Vous with Metric Semantics,”New Generation Computing, 12, 1, pp. 53–90, 1993.

    Article  MATH  Google Scholar 

  4. de Bakker, J.W. and Zucker, J.I., “Processes and the Denotational Semantics of Concurrency,”Information and Control, 54, pp. 70–120., 1982.

    Article  MATH  MathSciNet  Google Scholar 

  5. Bergstra, J.A., Klop, J.W., and Olderog, E.-R., “Readies and Failures in the Algebra of Communicating Processes,”SIAM J. of Computing, 17, 6, pp. 1134–1177, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  6. Bloom, B., Istrail, S., and Meyer, A. R., “Bisimulation Can’t Be Traced: Preliminary Report,” inProceedings of the 15th POPL, San Diego, California, 1988, pp. 229–239, 1988.

  7. Brookes, S.D., Hoare, C.A.R., and Roscoe,. A.W., “A Theory of Communicating Sequential Processes,”Journal of the Association for Computing Machinery, 31, pp. 560–599, 1984.

    MATH  MathSciNet  Google Scholar 

  8. Brookes, S.D. and Roscoe, A.W., “An Improved Failures Model for Communicating Processes,” inProc. of NSF-SERC Seminar on Concurrency, Lecture Notes in Computer Science, 197, Springer, Berlin, pp. 281–305, 1985.

    Google Scholar 

  9. Dugundji, J.,Topology, Allyn and Bacon, Boston, 1966.

    MATH  Google Scholar 

  10. van Glabbeek, R.J., “The Linear Time-Branching Time Spectrum,” inProc. of CONCUR’90 (J.C.M. Baten and J.W. Klop, eds.),Lecture Notes in Computer Science, 458, Springer, Berlin, pp. 278–297, 1990.

    Google Scholar 

  11. van Glabbeek, R.J., “Comparative Concurrency Semantics and Refinement of Actions,”Ph. D. thesis, Free University of Amsterdam, 1990.

  12. Groote, J.F. and Vaandrager, F., “Structured Operational Semantics and Bisimulation as a Congruence,”Information and Computation, 100, 2, pp. 202–260, 1988.

    Article  MathSciNet  Google Scholar 

  13. Hennessy, M.,Algebraic Theory of Processes, MIT Press, 1988.

  14. Hennessy, M.,The Semantics of Programming Languages, John Wiley & Sons Ltd., Chichester, 1990.

    MATH  Google Scholar 

  15. Horita, E., “Fully Abstract Models for Communicating Processes with Respect to Weak Linear Semantics with Divergence,”IEICE Transactions on Information and Systems, E75-D, 1, pp. 64–77, 1992.

    Google Scholar 

  16. Horita, E., “Deriving Compositional Models for Concurrency Based on De Bakker-Zucker Metric Domain from Structured Operational Semantics,”IEICE Transactions on Information and Systems, E75-A, 3, pp. 400–409, 1992.

    Google Scholar 

  17. Horita, E., “Deriving Denotational Models for Nonuniform Concurrency from Structured Operational Semantics,”IPSJ Technical Report, 92, 67, 92-PRG-8, pp. 1–8, 1992.

    Google Scholar 

  18. Horita, E., “A Fully Abstract Model for a Nonuniform Concurrent Language with Parameterization and Locality,” inSemantics: Foundations and Applications, Proceedings of the REX’92 Workshop (J.W. de Bakker, W.P. de Roever, and G. Rozenberg, eds.),Lecture Notes in Computer Science, 666, Springer, Berlin., pp. 288–317, 1993.

    Google Scholar 

  19. Horita, E., “Fully Abstract Models for Concurrent Languages,”Ph.D. thesis, the Free University of Amsterdam, 1993. (Also appeared asECL Technical Report, No. 8939.)

  20. Horita, E., de Bakker, J.W., and Rutten, J.J.M.M., “Fully Abstract Denotational Models for Nonuniform Concurrent Languages,”Information and Computation, 115, 1, pp. 125–178, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  21. Kok, J.N. and Rutten, J.J.M.M., “Contractions in Comparing Concurrency Semantics,” inTheoretical Computer Science, 76, pp. 179–222, 1990.

  22. Milner, R., “A Calculus of Communicating Systems,”Lecture Notes in Computer Science, 92, Springer, 1980.

  23. Olderog, E.-R. and Hoare, C.A.R., “Specification-Oriented Semantics for Communicating Processes,”Acta Informatica, 23, pp. 9–66, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  24. Plotkin, G.D., “A Structural Approach to Operational Semantics,”Report DAIMIFN-19, Comp. Sci. Dept., Aarhus Univ., 1981.

  25. Plotkin, G.D., “An Operational Semantics for CSP,”in Formal Description of Programming Concepts II (D. Bjoerner, ed.), IFIP, North-Holland, pp. 199–223, 1983.

    Google Scholar 

  26. Ponse, A., “Process Algebras with Data,”Ph. D. thesis, University of Amsterdam, 1992.

  27. Rutten, J.J.M.M., “Correctness and Full Abstraction of Metric Semantics for Concurrency,” inLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency (J.W. de Bakker, W.P. de Roever, G. Rozenberg, eds.),Lecture Notes in Computer Science, 354, Springer, Berlin, pp. 628–658, 1989.

    Chapter  Google Scholar 

  28. Rutten, J.J.M.M., “Deriving Denotational Models for Bisimulation from Structured Operational Semantics,” inProceedings of IFIP TC2 Working Conference, on Programming Concepts and Methods (M. Broy, C.B. Jones, eds.), North-Holland, pp. 155–178, 1990.

  29. de Simone, R., “Higher-Level Synchronising Devices in Meije-Sccs,”Theoretical Computer Science, 37, pp. 245–267, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  30. Vaandrager, F.W., “On the Relationship between Process Algebra and Input/Output Automata (Extended Abstract),” inProceedings of LICS’91, IEEE Computer Society Press, pp. 387–398, 1991. (A draft full version was communicated personally in June, 1992.)

Download references

Author information

Author notes

  1. Eiichi Horita

    Present address: NTT Communication Science Laboratories, 2-2, Hikaridai, Seika-cho, Soraku-gun, 619-02, Kyoto, Japan

Authors and Affiliations

  1. NTT Software Laboratories, 3-9-11 Midori-cho, Musashino-shi, 180, Tokyo, Japan

    Eiichi Horita

Authors
  1. Eiichi Horita
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Eiichi Horita, Ph.D.: He joined NTT Electrical Communications Laboratoires in 1984, where he has been working on formal description and verification of communication protocols, formal specification languages, and semantics and implementation of concurrent programming languages. At present, he is a senior research scientist at NTT Communication Science Laboratories. He received the B.Sc. degree in mathematics in 1982 from Kyoto University, the M.Eng. degree in applied mathematics in 1984 from Kyushu University, and Ph.D. degree in Computer Science in 1993 from Vrije Universiteit Amsterdam. During 1989–1990 he was a visiting researcher at the Center for Mathematics and Computer Science, Amsterdam.

About this article

Cite this article

Horita, E. Deriving failures models for nonuniform concurrency from structured operational semantics. New Gener Comput 14, 343–389 (1996). https://doi.org/10.1007/BF03037487

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037487

Keywords

Search

Navigation