A partial order event model for concurrent objects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1664 LNCS, Issue , 1999, Pages 415-430

  Meseguer, José ^a   Talcott, Carolyn ^b  

^a SRI INTERNATIONAL   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONCURRENCY MODELING; CONCURRENT COMPUTATION; CONCURRENT OBJECTS; EQUATIONAL THEORY; FORMAL REASONING; MOBILE OBJECT SYSTEMS; REWRITING LOGIC; TRUE CONCURRENCY;

SEMANTICS;

EID: 22644450258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_29     Document Type: Conference Paper

References (32)

1. H. G. Baker and C. Hewitt. Laws for communicating parallel processes. In IFIP Congress, pages 987-992. IFIP, Aug. 1977.
2. E. Best and R. Devillers. Sequential and concurrent behavior in Petri net theory. Theoretical Computer Science, 55:87-136, 1989.
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.
4. W. D. Clinger. Foundations of actor semantics. AI-TR- 633, MIT Artificial Intelligence Laboratory,May 1981.
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.
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.
7. P. Degano, J. Meseguer, and U. Montanari. Axiomatizing the algebra of net computations and processes. Acta Informatica, 33:641-667, 1996.
8. P. Degano and U.Montanari. Concurrent histories, a basis for observing distributed systems. J. of Computer and System Sciences, 34:422-461, 1987.
9. P. Degano and C. Priami. Proved trees. In Proc. ICALP'92, pages 629-640. Springer LNCS 623, 1992.
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.
12. C. H. C. Duarte. Proof-theoretic Foundations for the Design of Extensible Software Systems. PhD thesis, Imperial College, University of London, 1999.
13. U. Goltz andW. Reisig. The nonsequential behavior of petri nets. Information and Computation, 57:125-147, 1983.
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.
15. C. Laneve and U. Montanari. Axiomatizing permutation equivalence. Mathematical Structures in Computer Science, 6:219-249, 1996.
16. U. Lechner, C. Lengauer, F. Nickl, and M. Wirsing. How to overcome the inheritance anomaly. in Proc.ECOOP'96, Springer LNCS, 1996.
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.
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.
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.
20. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
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 Concurrent Object-Oriented Programming, pages 314-390.MIT Press, 1993.
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.
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.
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.
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.
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.
27. D. Peled. Combining partial order reductions with on-the-flymodel- checking. Formal Methods in System Design, 8:39-64, 1996.
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 co-algebras. To appear in Mathematical Structures in Computer Science, 1995. Presented at Dagstuhl Seminar on Specification and Semantics, Schloss Dagstuhl, Germany, May 1993.
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.
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.