[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

On Formal Modeling of Agent Computations

  • Conference paper
  • First Online:
Formal Approaches to Agent-Based Systems (FAABS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1871))

Included in the following conference series:

Abstract

This paper describes a comparative study of three formal methods for modeling and validating agent systems. The study is part of a joint project by researchers in MIT’s Theory of Distributed Systems research group and NTT’s Cooperative Computing research group. Our goal is to establish a mathematical and linguistic foundation for describing and reasoning about agent-style systems.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. T. Araragi. Agent programming and its formal verification (in Japanese), technical report ai99-47, pp. 47–54. Technical report, The Institute of Electronics, Information and Communication Engineers, 1999.

    Google Scholar 

  2. T. Araragi, P. Attie, I. Keidar, K. Kogure, V. Luchangco, N. Lynch, and K. Mano. On Formal Modeling of Agent Computations. Tech. Report, MIT Lab. for Comp. Sci. Url: http://theory.lcs.mit.edu/.idish/Abstracts/agents-compare.html

  3. P.C. Attie and N.A. Lynch. A formal model for dynamic computation. Tech. report, MIT Lab. for Computer Science. To appear.

    Google Scholar 

  4. E. M. Clarke, E. A. Emerson, and P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst., 8(2):244–263, Apr. 1986.

    Google Scholar 

  5. R. Fagin, J.Y. Halpern, Y. Moses, and M.Y. Vardi. Reasoning about Knowledge. The MIT Press, Cambridge, Mass., 1995.

    MATH  Google Scholar 

  6. E. Horita and K. Mano. Nepi2: a two-level calculus for network programming based on the π-calculus. In Proc. 3rd Asian Computing Science Conference (ASIAN’97). Springer LNCS 1345, 1997.

    Google Scholar 

  7. N. A. Lynch and M. R. Tuttle. An introduction to input/output automata. CWI-Quarterly, 2(3):219–246, Sep. 1989. Also MIT/LCS/TM-373, Nov. 1988.

    Google Scholar 

  8. R. Milner. Communicating and mobile systems: the π-calculus. Addison-Wesley, Reading, Mass., 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Araragi, T. et al. (2001). On Formal Modeling of Agent Computations. In: Rash, J.L., Truszkowski, W., Hinchey, M.G., Rouff, C.A., Gordon, D. (eds) Formal Approaches to Agent-Based Systems. FAABS 2000. Lecture Notes in Computer Science(), vol 1871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45484-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45484-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42716-2

  • Online ISBN: 978-3-540-45484-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics