Skip to main content
Log in

On the Computation of Natural Observers in Discrete-Event Systems

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

Natural projections with the observer property have proved effective in reducing the computational complexity of nonblocking supervisory control design, and the state sizes of the resulting controllers. In this paper we present an algorithm to verify this property, or if necessary to achieve it. A natural projection is a special type of general causal reporter map; for the latter an algorithm is already known for verification and modification. This algorithm could be used to verify the observer property of a natural projection, but if the natural projection is not an observer the algorithm is not applicable to modify it to an observer. Also, while a general reporter map always admits a unique smallest refinement with the observer property, a natural projection does not. Indeed there may exist several minimal extensions to the original observable event set of a natural projection. We show that the problem of finding a minimal extension is NP-hard, but propose a polynomial-time algorithm that always finds an acceptable extension. While not guaranteed to be minimal, it is in practice often reasonably small.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

Notes

  1. This monograph was first available online in 1998 under the title Notes on Control of Discrete-Event Systems. Since then it has been annually updated. The title was changed to Supervisory Control of Discrete-Event Systems in 2004.

  2. If a natural projection of a DES does not satisfy the observer property, the projected model may be exponentially larger than the original (Wong 1998).

  3. Here the parallel with linear system theory is exact: cf. Wonham (1985), Section 3.2.

  4. Available on the website http://www.control.utoronto.ca/DES.

References

  • Cassandras CG, Lafortune S (1999) Introduction to discrete event systems. Kluwer, Boston

    MATH  Google Scholar 

  • Cho H (1990) Designing observation functions in supervisory control. In: Proc. Korean automatic control conference, Seoul, 26–27 October 1990, pp 523–528

  • Feng L (2007) Computationally efficient supervisor design in discrete-event systems. PhD thesis, Department of ECE, University of Toronto, Toronto, ON, Canada. http://www.control.utoronto.ca/fenglei

  • Feng L, Wonham WM (2006a) Computationally efficient supervisor design in discrete-event systems: abstraction and modularity. In: Lafortune S, Lin F, Tilbury D (eds) Proc. the 8th international workshop on discrete event systems, Ann Arbor, 10–12 July 2006, pp 3–8

  • Feng L, Wonham WM (2006b) On the computation of natural observers in discrete-event systems. In: Proc. the 45th IEEE conference on decision and control, San Diego, 13–15 December 2006, pp 428–433

  • Feng L, Wonham WM (2008) Supervisory control architecture for discrete-event systems. IEEE Trans Automat Contr 53:1449–1461

    Article  MathSciNet  Google Scholar 

  • Fernandez JC (1990) An implementation of an efficient algorithm for bisimulation equivalence. Sci Comput Program 13(2–3):219–236

    Article  MATH  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco

    MATH  Google Scholar 

  • Gohari P, Wonham WM (2000) On the complexity of supervisory control design in the RW framework. IEEE Trans Syst Man Cybern B 30(5):643–652

    Article  Google Scholar 

  • Haji-Valizadeh A, Loparo KA (1996) Minimizing the cardinality of an events set for supervisors of discrete-event dynamical systems. IEEE Trans Automat Contr 41(11):1579–1593

    Article  MATH  MathSciNet  Google Scholar 

  • Hill R, Tilbury D (2006) Modular supervisory control of discrete-event systems with abstraction and incremental hierarchical construction. In: Lafortune S, Lin F, Tilbury D (eds) Proc. the 8th international workshop on discrete event systems, Ann Arbor, 10–12 July 2006, pp 399–406

  • Hubbard P, Caines PE (2002) Dynamical consistency in hierarchical supervisory control. IEEE Trans Automat Contr 47(1):37–52

    Article  MathSciNet  Google Scholar 

  • Jiang S, Kumar R, Garcia HE (2003) Optimal sensor selection for discrete-event systems with partial observation. IEEE Trans Automat Contr 48(3):369–381

    Article  MathSciNet  Google Scholar 

  • Leduc RJ, Brandin BA, Lawford M, Wonham WM (2005a) Hierarchical interface-based supervisory control-part I: serial case. IEEE Trans Automat Contr 50(9):1322–1335

    Article  MathSciNet  Google Scholar 

  • Leduc RJ, Lawford M, Wonham WM (2005b) Hierarchical interface-based supervisory control-part II: parallel case. IEEE Trans Automat Contr 50(9):1336–1348

    Article  MathSciNet  Google Scholar 

  • Lin F, Wonham WM (1988) Decentralized supervisory control of discrete-event systems. Inform Sci 44(3):199–224

    Article  MATH  MathSciNet  Google Scholar 

  • Ma C, Wonham WM (2005) Nonblocking supervisory control of state tree structures. In: Thomas M, Morari M (eds) LNCIS, vol 317. Springer, Berlin

    Google Scholar 

  • Mac Lane S, Birkhoff G (1979) Algebra. Macmillan, New York

    Google Scholar 

  • Milner R (1989) Communication and concurrency. Prentice Hall, New York

    MATH  Google Scholar 

  • Pena PN, Cury JER, Lafortune S (2006) Testing modularity of local supervisors: an approach based on abstractions. In: Lafortune S, Lin F, Tilbury D (eds) Proc. the 8th international workshop on discrete event systems, Ann Arbor, 10–12 July 2006, pp 107–112

  • Ramadge PJ, Wonham WM (1989) The control of discrete event systems. Proc IEEE 77(1):81–89

    Article  Google Scholar 

  • Rohloff KR, Khuller S, Kortsarz G (2006) Approximating the minimal sensor selection for supervisory control. Discrete Event Dyn Syst 16(1):143–170

    Article  MATH  MathSciNet  Google Scholar 

  • Rohloff KR, Lafortune S (2002) On the computational complexity of the verification of modular discrete-event systems. In: Proc. the 41st IEEE conference on decision and control, Las Vegas, 10–13 December 2002

  • Schmidt K, Moor T (2006) Marked-string accepting observers for the hierarchical and decentralized control of discrete event systems. In: Lafortune S, Lin F, Tilbury D (eds) Proc. the 8th international workshop on discrete event systems, Ann Arbor, 10–12 July 2006, pp 413–418

  • Schmidt K, Moor T, Perk S (2005) A hierarchical architecture for nonblocking control of decentralized discrete event systems. In: Proc. the 13th Mediterranean conference on control and automation, Limassol, 27–29 June 2005, pp 902–907

  • Schmidt K, Marchand H, Gaudin B (2006) Modular and decentralized supervisory control of concurrent discrete event systems using reduced system models. In: Lafortune S, Lin F, Tilbury D (eds) Proc. the 8th international workshop on discrete event systems, Ann Arbor, 10–12 July 2006, pp 149–154

  • Sipser M (1997) Introduction to the theory of computation. PWS, Boston

    MATH  Google Scholar 

  • Wong K (1998) On the complexity of projections of discrete-event systems. In: Proc. the 4th international workshop on discrete event systems, Cagliari, 26–28 August 1998, pp 201–206

  • Wong K, Wonham WM (1996) Hierarchical control of discrete-event systems. Discrete Event Dyn Syst 6(3):241–273

    Article  MATH  MathSciNet  Google Scholar 

  • Wong K, Wonham WM (1998) Modular control and coordination of discrete-event systems. Discrete Event Dyn Syst 8(3):247–297

    Article  MATH  MathSciNet  Google Scholar 

  • Wonham WM (1985) Linear multivariable control: a geometric approach, 3rd ed. Springer, London

    MATH  Google Scholar 

  • Wonham WM (2007) Supervisory control of discrete-event systems, Department of Electrical and Computer Engineering, University of Toronto, 1998–2007. http://www.control.utoronto.ca/DES (updates posted annually)

  • Wong K, Wonham WM (2004) On the computation of observers in discrete-event systems. Discrete Event Dyn Syst 14(1):55–107

    Article  MATH  MathSciNet  Google Scholar 

  • Yoo T-S, Lafortune S (2002) NP-completeness of sensor selection problems arising in partially-observed discrete-event systems. IEEE Trans Automat Contr 47(9):1495–1499

    Article  MathSciNet  Google Scholar 

  • Young SD, Garg VK (1993) Optimal sensor and actuator choices for discrete event systems. In: Proc. the 31st Allerton conference on communication, control, and computing, Allerton, September 1993

  • Zhou M, DiCesare F, Rudolph D (1992) Design and implementation of a petri net based supervisor for a flexible manufacturing system. Automatica 28(6):1199–1208

    Article  MATH  MathSciNet  Google Scholar 

  • Zhong H, Wonham WM (1990) On the consistency of hierarchical supervision in discrete-event systems. IEEE Trans Automat Contr 35(10):1125–1134

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lei Feng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feng, L., Wonham, W.M. On the Computation of Natural Observers in Discrete-Event Systems. Discrete Event Dyn Syst 20, 63–102 (2010). https://doi.org/10.1007/s10626-008-0054-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-008-0054-3

Keywords

Navigation