Skip to main content

An Optimality Principle for Concurrent Systems

  • Conference paper
AI 2008: Advances in Artificial Intelligence (AI 2008)

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

Included in the following conference series:

  • 1791 Accesses

Abstract

This paper presents a formulation of an optimality principle for a new class of concurrent decision systems formed by products of deterministic Markov decision processes (MDPs). For a single MDP, the optimality principle reduces to the usual Bellman’s equation. The formulation is significant because it provides a basis for the development of optimisation algorithms for decentralised decision systems including a recently proposed method based on Petri Net unfoldings.

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 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. Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. 1 and 2. Athena Scientific, Belmont (2001)

    MATH  Google Scholar 

  2. Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann, San Francisco (2004)

    MATH  Google Scholar 

  3. Hickmott, S.L.: Directed Unfolding: Reachability Analysis of Concurrent Systems and Applications to Automated Planning, Ph.D. Thesis, School of Electrical and Electronic Engineering, The University of Adelaide (2008)

    Google Scholar 

  4. Hickmott, S., Rintanen, J., Thiébaux, S., White, L.B.: Planning via Petri Net Unfolding. In: Proc. 20th Int. Joint Conf. on Artificial Intelligence, India, pp. 1904–1911 (2007)

    Google Scholar 

  5. Bonet, B., Haslum, P., Hickmott, S., Thiébaux, S.: Directed Unfolding of Petri Nets. In: Workshop on Unfolding and Partial Order Techniques. In 28th Int. Conf. of Application and Theory of Petri Nets and other Models of Concurrency, Poland (2007)

    Google Scholar 

  6. Esparza, J., Heljanko, K.: Unfoldings: A Partial Order Approach to Model Checking. Springer, Berlin (2008)

    MATH  Google Scholar 

  7. Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  8. Benveniste, A., Fabre, E., Haar, S.: Markov Nets: Probabilistic Models for Distributed and Concurrent Systems, Rapport de Recherche INRIA RR-4253 (September 2001)

    Google Scholar 

  9. Haar, S.: Probabilistic Cluster Unfoldings. Fundamenta Informaticae 53, 3-4, 281–314 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

White, L.B., Hickmott, S.L. (2008). An Optimality Principle for Concurrent Systems. In: Wobcke, W., Zhang, M. (eds) AI 2008: Advances in Artificial Intelligence. AI 2008. Lecture Notes in Computer Science(), vol 5360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89378-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89378-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89377-6

  • Online ISBN: 978-3-540-89378-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics