Skip to main content

A Supervisor Synthesis Tool for Finite Nondeterministic Automata with Data

  • Conference paper
  • First Online:
Software Engineering and Formal Methods (SEFM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8368))

Included in the following conference series:

Abstract

Supervisory control theory deals with automated synthesis of models of supervisory controllers based on the models of the unsupervised systems and the control requirements. The models of the supervisory controllers are referred to as supervisors. We present a supervisor synthesis tool for finite nondeterministic automata with data-based control requirements. The tool implements a process-theoretic approach to supervisory control theory, which employs the behavioral preorder partial bisimulation to characterize the notion of a supervisor. To illustrate the tool, we remodel an industrial case study dealing with coordination of maintenance procedures of a printing process of a high-tech printer.

Supported by Dutch NWO project ProThOS, no. 600.065.120.11N124.

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 EPUB and 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

References

  1. Akesson, K., Fabian, M., Flordal, H., Malik, R.: Supremica - an integrated environment for verification, synthesis and simulation of discrete event systems. In: Proceedings of WODES 2006. pp. 384–385. IEEE (2006)

    Google Scholar 

  2. Baeten, J.C.M., van Beek, D.A., Luttik, B., Markovski, J., Rooda, J.E.: A process-theoretic approach to supervisory control theory. In: Proceedings of ACC 2011, pp. 4496–4501. IEEE (2011)

    Google Scholar 

  3. Baeten, J., van Beek, D., van Hulst, A., Markovski, J.: A process algebra for supervisory coordination. In: Proceedings of PACO 2011. EPTCS, vol. 60, pp. 36–55. Open Publishing Association (2011)

    Google Scholar 

  4. Cassandras, C., Lafortune, S.: Introduction to discrete event systems. Kluwer Academic, Dordrecht (2004)

    Google Scholar 

  5. Chen, Y.L., Lin, F.: Modeling of discrete event systems using finite state machines with parameters. In: Proceedings of CCA 2000, pp. 941–946 (2000)

    Google Scholar 

  6. Feng, L., Wonham, W.M.: TCT: a computation tool for supervisory control synthesis. In: Proceedings of WODES 2006, pp. 388–389. IEEE (2006)

    Google Scholar 

  7. Gaudin, B., Deussen, P.: Supervisory control on concurrent discrete event systems with variables. In: Proceedings of ACC 2007, pp. 4274–4279 (2007)

    Google Scholar 

  8. van Glabbeek, R.J.: The linear time – branching time spectrum I. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3–99. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  9. Leveson, N.: The challenge of building process-control software. IEEE Softw. 7(6), 55–62 (1990)

    Article  Google Scholar 

  10. Ma, C., Wonham, W.M.: Nonblocking Supervisory Control of State Tree Structures. LNCIS, vol. 317. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  11. Markovski, J.: Communicating processes with data for supervisory coordination. In: Proceedings of FOCLASA 2012. EPTCS, vol. 91, pp. 97–111. Open Publishing Association (2012)

    Google Scholar 

  12. Markovski, J.: Controllability for nondeterministic finite automata with variables. In: Proceedings of ICSOFT 2013. CCIS, Springer (2013) (To appear)

    Google Scholar 

  13. Markovski, J.: Supervisor synthesis tool and demo models. http://sites.google.com/site/jasenmarkovski (2013)

  14. Markovski, J., Jacobs, K.G.M., van Beek, D.A., Somers, L.J.A.M., Rooda, J.E.: Coordination of resources using generalized state-based requirements. In: Proceedings of WODES 2010. pp. 300–305. IFAC (2010)

    Google Scholar 

  15. Miremadi, S., Akesson, K., Lennartson, B.: Extraction and representation of a supervisor using guards in extended finite automata. In: Proceedings of WODES 2008, pp. 193–199. IEEE (2008)

    Google Scholar 

  16. Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAM J. Control Opt. 25(1), 206–230 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  17. Rutten, J.J.M.M.: Coalgebra, concurrency, and control. In: Boel, R., Stremersch, G. (eds.) Proceedings of WODES 2000, pp. 31–38. Kluwer, Dotretch (2000)

    Google Scholar 

  18. Skoldstam, M., Akesson, K., Fabian, M.: Modeling of discrete event systems using finite automata with variables. In: Proceedings of CDC 2007, pp. 3387–3392. IEEE (2007)

    Google Scholar 

  19. Ziller, R., Schneider, K.: Combining supervisor synthesis and model checking. ACM Trans. Embed. Comput. Syst. 4(2), 331–362 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jasen Markovski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kirilov, A., Martinovikj, D., Mishevski, K., Petkovska, M., Trajcheska, Z., Markovski, J. (2014). A Supervisor Synthesis Tool for Finite Nondeterministic Automata with Data. In: Counsell, S., Núñez, M. (eds) Software Engineering and Formal Methods. SEFM 2013. Lecture Notes in Computer Science(), vol 8368. Springer, Cham. https://doi.org/10.1007/978-3-319-05032-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05032-4_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05031-7

  • Online ISBN: 978-3-319-05032-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics