Skip to main content
SpringerLink
Log in

A Partial Order Event Model for Concurrent Objects

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1664))

Included in the following conference series:

Abstract

The increasing importance and ubiquity of distributed and mobile object systems makes it very desirable to develop rigorous semantic models and formal reasoning techniques to ensure their correctness. The concurrency model of rewriting logic has been extensively used by a number of authors to specify, execute, and validate concurrent object systems. This model is a true concurrency model, associating an algebra of proof terms T R o to the rewrite theory Rspecifying the desired system. The elements of T o/R are concurrent computations described as proofs modulo an equational theory of proof/computation equivalence. This paper builds a very intuitive alternate model E R, also of a true concurrency nature, but based instead on the notion of concurrent events and a causality partial order between such events. The main result of the paper is the equivalence of these two models expressed as an isomorphism. Both models have straightforward extensions to similar models of infinite computations. The models are very general and can express both synchronous and asynchronous object computations. In the asynchronouscase the Baker-Hewitt eventmodel for actors appears as a special case of our model.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. G. Baker and C. Hewitt. Laws for communicating parallel processes. In IFIP Congress, pages 987–992. IFIP, Aug. 1977.

    Google Scholar 

  2. E. Best and R. Devillers. Sequential and concurrent behavior in Petri net theory. Theoretical Computer Science, 55:87–136, 1989.

    Article  MathSciNet  Google Scholar 

  3. G. Carabetta, P. Degano, and F. Gadducci. CCS semantics via proved transition systems and rewriting logic. Proc. 2nd Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1998.

    Google Scholar 

  4. W. D. Clinger. Foundations of actor semantics. AI-TR633, MIT Artificial Intelligence Laboratory, May 1981.

    Google Scholar 

  5. A. Corradini, F. Gadducci, and U. Montanari. Relating two categoricalmodels of term rewriting. In J. Hsiang, editor, Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 225–240, 1995.

    Google Scholar 

  6. P. Darondeau and P. Degano. Causal trees. In M. Ausiello, G. DezaniCiancaglini and S. Ronchi Della Rocca, editors, 16th ICALP, Lecture Notes in Computer Science, pages 234–248. Springer-Verlag, 1989.

    Google Scholar 

  7. P. Degano, J. Meseguer, and U. Montanari. Axiomatizing the algebra of net computations and processes. Acta Informatica, 33:641–667, 1996.

    Article  MathSciNet  Google Scholar 

  8. P. Degano and U. Montanari. Concurrent histories, a basis for observing distributed systems. J. of Computer and System Sciences, 34:422–461, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  9. P. Degano and C. Priami. Proved trees. In Proc. ICALP’92, pages 629–640. Springer LNCS 623, 1992.

    Google Scholar 

  10. G. Denker. From rewrite theories to temporal logic theories: A distributed temporal logic extension of rewriting logic. In C. Kirchner and H. Kirchner, editors, 2nd International Workshop on Rewriting Logic and its Applications, WRLA’98, volume 15 of Electronic Notes in Theoretical Computer Science, 1998. URL: http://www.elsevier.nl/locate/entcs/volume15.html.

  11. G. Denker, J. Meseguer, and C. Talcott. Protocol specification and analysis in Maude. In N. Heintze and J. Wing, editors, Workshop on Formal Methods and Security Protocols, 25 June 1998, Indianapolis, Indiana, 1998.

    Google Scholar 

  12. C. H. C. Duarte. Proof-theoretic Foundations for the Design of Extensible Software Systems. PhD thesis, Imperial College, University of London, 1999.

    Google Scholar 

  13. U. Goltz and W. Reisig. The nonsequential behavior of petri nets. Information and Computation, 57:125–147, 1983.

    MATH  MathSciNet  Google Scholar 

  14. S. Katz. Refinementwith global equivalence proofs in temporal logic. In DIMACS Series in Discrete Mathematics, Vol. 29, pages 59–78. American Mathematical Society, 1997.

    Google Scholar 

  15. C. Laneve and U. Montanari. Axiomatizing permutation equivalence. Mathematical Structures in Computer Science, 6:219–249, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  16. U. Lechner, C. Lengauer, F. Nickl, and M. Wirsing. How to overcome the inheritance anomaly. in Proc.ECOOP’96, Springer LNCS, 1996.

    Google Scholar 

  17. U. Lechner, C. Lengauer, and M. Wirsing. An object-oriented airport. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification, Santa Margherita, Italy, May/June 1994, pages 351–367. Springer LNCS 906, 1995.

    Chapter  Google Scholar 

  18. P. Lincoln, N. Martí-Oliet, and J. Meseguer. Specification, transformation, and programming of concurrent systems in rewriting logic. In G. Blelloch, K. Chandy, and S. Jagannathan, editors, Specification of Parallel Algorithms, pages 309–339. DIMACS Series, Vol. 18, American Mathematical Society, 1994.

    Google Scholar 

  19. J. Meseguer. A logical theory of concurrent objects. In ECOOP-OOPSLA’90 Conference on Object-Oriented Programming, Ottawa, Canada, October 1990, pages 101–115. ACM, 1990.

    Google Scholar 

  20. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73–155, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  21. J. Meseguer. A logical theory of concurrent objects and its realization in theMaude language. In G. Agha, P. Wegner, and A. Yonezawa, editors, ResearchDirections in ConcurrentObjectOriented Programming, pages 314–390.MIT Press, 1993.

    Google Scholar 

  22. J. Meseguer. Solving the inheritance anomaly in concurrent object-oriented programming. In O. M. Nierstrasz, editor, Proc. ECOOP’93, pages 220–246. Springer LNCS 707, 1993.

    Google Scholar 

  23. J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Proc. CONCUR’96, Pisa, August 1996, pages 331–372. Springer LNCS 1119, 1996.

    Google Scholar 

  24. J. Meseguer. Membership algebra as a semantic framework for equational specification. In F. Parisi-Presicce, editor, Workshop on Abstract Data Types, WADT’97, volume 1376 of Lecture Notes in Computer Science, pages 18–61. Springer, 1998.

    Google Scholar 

  25. J. Meseguer. Research directions in rewriting logic. In U. Berger and H. Schwichtenberg, editors, Computational Logic, NATO Advanced Study Institute, Marktoberdorf, Germany, July 29-August 6, 1997. Springer-Verlag, 1998.

    Google Scholar 

  26. J. Meseguer and X. Qian. A logical semantics for object-oriented databases. In Proc. International SIGMOD Conference on Management of Data, pages 89–98. ACM, 1993.

    Google Scholar 

  27. D. Peled. Combining partial order reductions with on-the-flymodel-checking. FormalMethods in System Design, 8:39–64, 1996.

    Article  Google Scholar 

  28. I. Pita and N. Martí-Oliet. A Maude specification of an object oriented database model for telecommunication networks. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996. http://www1.elsevier.nl/mcs/tcs/pc/volume4.htm.

  29. H. Reichel. An approach to object semantics based on terminal coalgebras. To appear in Mathematical Structures in Computer Science, 1995. Presented at Dagstuhl Seminar on Specification and Semantics, Schloss Dagstuhl, Germany, May 1993.

    Google Scholar 

  30. C. L. Talcott. An actor rewriting theory. In J. Meseguer, editor, Proc. 1st Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, pages 360–383. North Holland, 1996. http://www1.elsevier.nl/mcs/tcs/pc/volume4.htm.

  31. C. L. Talcott. Interaction semantics for components of distributed systems. In E. Najm and J.-B. Stefani, editors, 1st IFIP Workshop on Formal Methods for Open Object-based Distributed Systems, FMOODS’96, 1996. Proceedings published in 1997 by Chapman & Hall.

    Google Scholar 

  32. M. Wirsing and A. Knapp. A formal approach to object-oriented software engineering. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996. <http://www1.elsevier.nl/mcs/tcs/pc/volume4.htm>.

Download references

Author information

Authors and Affiliations

  1. SRI International, Menlo Park, CA, 94025, USA

    José Meseguer

  2. Stanford University, Stanford, CA, 94305, USA

    Carolyn Talcott

Authors
  1. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carolyn Talcott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meseguer, J., Talcott, C. (1999). A Partial Order Event Model for Concurrent Objects. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66425-3

  • Online ISBN: 978-3-540-48320-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation