Abstract
This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the context of discrete event systems, where two concurrent systems are said to be in conflict if they can get trapped in a situation where they are waiting or running endlessly, forever unable to complete their common task. In order to analyse complex discrete event systems, conflict-preserving notions of refinement and equivalence are needed. This paper characterises an appropriate refinement, called the conflict preorder, and provides a denotational semantics for it. Its relationship to other known process preorders is explored, and it is shown to generalise the fair testing preorder in process-algebra for reasoning about conflicts in discrete event systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brandin, B., Charbonnier, F.: The supervisory control of the automated manufacturing system of the AIP. In: Proc. Rensselaer’s 4th Int. Conf. Computer Integrated Manufacturing and Automation Technology, Troy, NY, USA, pp. 319–324 (1994)
Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 313–327. Springer, Heidelberg (1995)
Brinksma, E., Rensink, A., Vogler, W.: Applications of fair testing. In: Gotzhein, R., Bredereke, J. (eds.) Formal Description Techniques IX: Theory, application and tools, IFIP TC6 WG6.1 Int. Conf. Formal Description Techniques IX / Protocol Specification, Testing and Verification XVI, Kaiserslautern, Germany. IFIP Conf. Proc., vol. 69, pp. 145–160. Kluwer, Dordrecht (1996)
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677–691 (1986)
Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems, September 1999. Kluwer, Dordrecht (1999)
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Programming Languages and Systems 8(2), 244–263 (1986)
Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
Dietrich, P., Malik, R., Wonham, W.M., Brandin, B.A.: Implementation considerations in supervisory control. In: Caillaud, B., Darondeau, P., Lavagno, L., Xie, X. (eds.) Synthesis and Control of Discrete Event Systems, pp. 185–201. Kluwer, Dordrecht (2002)
Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)
Leduc, R.J., Brandin, B.A., Wonham, W.M.: Hierarchical interface-based non-blocking verification. In: Proc. Canadian Conf. Electrical and Computer Engineering, May 2000, pp. 1–6 (2000)
Leduc, R.J., Wonham, W.M.: PLC implementation of a DES supervisor for a manufacturing testbed. In: Proc. 33rd Allerton Conf. Communication, Control and Computing, Monticello, Illinois, October 1995, pp. 519–528 (1995)
Malik, P.: From Supervisory Control to Nonblocking Controllers for Discrete Event Systems. PhD thesis, University of Kaiserslautern, Kaiserslautern, Germany (2003)
Malik, R.: On the set of certain conflicts of a given language. In: Proc. 7th Int. Workshop on Discrete Event Systems, WODES 2004, Reims, France (September 2004)
Malik, R., Mühlfeld, R.: A case study in verification of UML statecharts: the PROFIsafe protocol. J. Universal Computer Science 9(2), 138–151 (2003)
McMillan, K.L.: Symbolic Model Checking. Kluwer, Dordrecht (1993)
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: Proc. 22nd Int. Colloquium on Automata, Languages, and Programming, ICALP 1995, pp. 648–659 (1995)
Nicola, R.D., Hennessy, M.C.B.: Testing equivalences for processes. Theoretical Comput. Sci. 34(1-2), 83–133 (1984)
Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. Proc. IEEE 77(1), 81–98 (1989)
Roscoe, W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)
van Glabbeek, R.J.: The linear time — branching time spectrum I: The semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3–99. Elsevier, Amsterdam (2001)
Wong, K.C., Thistle, J.G., Malhame, R.P., Hoang, H.-H.: Supervisory control of distributed systems: Conflict resolution. Discrete Event Dynamic Systems: Theory and Applications 10, 131–186 (2000)
Wong, K.C., Wonham, W.M.: Modular control and coordination of discreteevent systems. Discrete Event Dynamic Systems: Theory and Applications 8(3), 247–297 (1998)
Wonham, W.M.: Notes on control of discrete event systems, 1999. Systems Control Group, Dept. of Electrical Engineering, University of Toronto, Ontario, Canada; at, http://www.control.utoronto.ca/under “Research”.
Zhang, Z.H., Wonham, W.M.: STCT: An efficient algorithm for supervisory control design. In: Caillaud, B., Darondeau, P., Lavagno, L., Xie, X. (eds.) Synthesis and Control of Discrete Event Systems, pp. 77–100. Kluwer, Dordrecht (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malik, R., Streader, D., Reeves, S. (2004). Fair Testing Revisited: A Process-Algebraic Characterisation of Conflicts. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30476-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23610-8
Online ISBN: 978-3-540-30476-0
eBook Packages: Springer Book Archive