Skip to main content

Modularity and Composition in Propositional Statecharts

  • Conference paper
Diagrammatic Representation and Inference (Diagrams 2006)

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

Included in the following conference series:

Abstract

Propositional Statecharts, described in [3], are a variation of David Harel’s Statechart formalism [6] intended to enable both diagrammatic description of an agent interaction protocol, and interpretation as a theory in a dynamic logic. Here we provide an informal description of a diagrammatic extension to enable modular representation.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bauer, B., Muller, J.P., Odell, J.: Agent UML: A Formalism for Specifying Multiagent Software Systems. In: AOSE, pp. 91–104 (2000)

    Google Scholar 

  2. Cost, R., et al.: Modeling agent conversations with colored petri nets. In: Workshop on Specifying and Implementing Conversation Policies, pp. 59–66 (1999)

    Google Scholar 

  3. Dunn-Davies, H.R., Cunningham, R.J., Paurobally, S.: Propositional Statecharts for Agent Interaction Protocols. ENTCS, vol. 134, pp. 55–75 (2005)

    Google Scholar 

  4. Fornara, N., Colombetti, M.: Defining Interaction Protocols using a Commitment Based Agent Communication Language. In: Proceedings of AAMAS 2003 (2003)

    Google Scholar 

  5. Friedl, J.E.F.: Mastering Regular Expressions. O’Reilly, Sebastopol (2002)

    MATH  Google Scholar 

  6. Harel, D.: Statecharts: A visual formalism for complex systems. Sci. Comput. Programming 8, 231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  7. Paurobally, S., Cunningham, R.J.: Verification of Protocols for Automated Negotiation. In: van Harmelen, F. (ed.) Proceedings of ECAI 2002, pp. 43–47. IOS Press, Amsterdam (2002)

    Google Scholar 

  8. Sunyé, G., et al.: Refactoring UML Models. In: Gogolla, M., Kobryn, C. (eds.) UML 2001. LNCS, vol. 2185, pp. 134–148. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Vitteau, B., Huget, M.P.: Modularity in Interaction Protocols. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS (LNAI), vol. 2922, pp. 291–309. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dunn-Davies, H.R., Cunningham, R.J., Paurobally, S. (2006). Modularity and Composition in Propositional Statecharts. In: Barker-Plummer, D., Cox, R., Swoboda, N. (eds) Diagrammatic Representation and Inference. Diagrams 2006. Lecture Notes in Computer Science(), vol 4045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11783183_12

Download citation

  • DOI: https://doi.org/10.1007/11783183_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-35624-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics