Skip to main content
SpringerLink
Log in
Book cover

Time for Verification pp 26–41Cite as

Knowledge Based Scheduling of Distributed Systems

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6200))

Abstract

Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems it is hard to find efficient implementations for priorities; because they express constraints on global states, their implementation may incur considerable overhead.

Our method is based on performing model checking for knowledge properties. It allows identifying where the local information of a process is sufficient to schedule the execution of a high priority transition. As a result of the model checking, the program is transformed to react upon the knowledge it has at each point. The transformed version has no priorities, and uses the gathered information and its knowledge to limit the enabledness of transitions so that it matches or approximates the original specification of priorities.

This is a preview of subscription content, 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   99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Basu, A., Bidinger, P., Bozga, M., Sifakis, J.: Distributed Semantics and Implementation for Systems with Interaction and Priority. In: Suzuki, K., Higashino, T., Yasumoto, K., El-Fakih, K. (eds.) FORTE 2008. LNCS, vol. 5048, pp. 116–133. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Emerson, E.A., Clarke, E.M.: Characterizing Correctness Properties of Parallel Programs using Fixpoints. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 169–181. Springer, Heidelberg (1980)

    Chapter  Google Scholar 

  3. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  4. Halpern, J.Y., Zuck, L.D.: A little knowledge goes a long way: knowledge based derivation and correctness proof for a family of protocols. Journal of the ACM 39(3), 449–478 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hoare, C.A.R.: Communicating Sequential Processes. Communication of the ACM 21, 666–677 (1978)

    Article  MATH  Google Scholar 

  6. Gößler, G., Sifakis, J.: Priority Systems. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2003. LNCS, vol. 3188, pp. 443–466. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Genrich, H.J., Lautenbach, K.: System Modeling with High-level Petri Nets. Theoretical computer Science 13, 109–135 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  8. Graf, S., Peled, D., Quinton, S.: Achieving Distributed Control Through Model Checking. In: CAV 2010. Springer, Heidelberg (to appear, 2010)

    Google Scholar 

  9. Manna, Z., Pnueli, A.: How to Cook a Temporal Proof System for Your Pet Language. In: POPL 1983, Austin, TX, pp. 141–154 (1983)

    Google Scholar 

  10. van der Meyden, R.: Common Knowledge and Update in Finite Environment. Information and Computation 140, 115–157 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. Quielle, J.P., Sifakis, J.: Specification and Verification of Concurrent Systems. In: CESAR, 5th International Symposium on Programming, pp. 337–350 (1981)

    Google Scholar 

  12. Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete event processes. SIAM journal on control and optimization 25(1), 206–230 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. Rudie, K., Ricker, S.L.: Know means no: Incorporating knowledge into discrete-event control systems. IEEE Transactions on Automatic Control 45(9), 1656–1668 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Rudie, K., Wonham, W.M.: Think globally, act locally: decentralized supervisory control. IEEE Transactions on Automatic Control 37(11), 1692–1708 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Yoo, T.S., Lafortune, S.: A general architecture for decentralized supervisory control of discrete-event systems. Discrete event dynamic systems, theory & applications 12(3), 335–377 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre Equation - VERIMAG, 2 Avenue de Vignate, Gières, France

    Saddek Bensalem & Joseph Sifakis

  2. Department of Computer Science, Bar Ilan University, Ramat Gan, 52900, Israel

    Doron Peled

Authors
  1. Saddek Bensalem
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Doron Peled
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joseph Sifakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Stanford University, 94305, Stanford, CA, USA

    Zohar Manna

  2. Department of Computer Science, Bar Ilan University, 52900, Ramat Gan, Israel

    Doron A. Peled

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bensalem, S., Peled, D., Sifakis, J. (2010). Knowledge Based Scheduling of Distributed Systems. In: Manna, Z., Peled, D.A. (eds) Time for Verification. Lecture Notes in Computer Science, vol 6200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13754-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13754-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13753-2

  • Online ISBN: 978-3-642-13754-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation