Fair testing revisited: a process-algebraic characterisation of conflicts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3299, Issue , 2004, Pages 120-134

  Malik, Robi ^a   Streader, David ^a   Reeves, Steve ^a  

^a UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SEMANTICS;

CONCURRENT SYSTEMS; DENOTATIONAL SEMANTICS; FAIR TESTING; IN-PROCESS; PREORDERS; TESTING THEORIES;

DISCRETE EVENT SIMULATION;

EID: 33746899177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30476-0_14     Document Type: Article

References (27)

1. B. Brandin and F. Charbonnier. The supervisory control of the automated manufacturing system of the AIP. In Proc. Rensselaer's 4th Int. Conf. Computer Integrated Manufacturing and Automation Technology, pages 319-324, Troy, NY, USA, 1994.
2. E. Brinksma, A. Rensink, and W. Vogler. Fair testing. In I. Lee and S. A. Smolka, editors, Proc. 6th Int. Conf. Concurrency Theory, CONCUR '95, volume 962 of LNCS, pages 313-327, Philadelphia, PA, USA, 1995. Springer.
3. E. Brinksma, A. Rensink, and W. Vogler. Applications of fair testing. In R. Gotzhein and J. Bredereke, editors, Formal Description Techniques IX: Theory, application and tools, IFIP TC6 WG6.1 Int. Conf. Formal Description Techniques IX / Protocol Specification, Testing and Verification XVI, volume 69 of IFIP Conf. Proc., pages 145-160, Kaiserslautern, Germany, Oct. 1996. Kluwer.
4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput., 35(8):677-691, 1986.
5. C. G. Cassandras and S. Lafortune. Introduction to Discrete Event Systems. Kluwer, Sept. 1999.
6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Programming Languages and Systems, 8(2):244-263, 1986.
7. E. M. Clarke, Jr., O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
8. P. Dietrich, R. Malik, W. M. Wonham, and B. A. Brandin. Implementation considerations in supervisory control. In B. Caillaud, P. Darondeau, L. Lavagno, and X. Xie, editors, Synthesis and Control of Discrete Event Systems, pages 185-201. Kluwer, 2002.
9. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
10. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
11. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001.
12. R. J. Leduc, B. A. Brandin, and W. M. Wonham. Hierarchical interface-based non-blocking verification. In Proc. Canadian Conf. Electrical and Computer Engineering, pages 1-6, May 2000.
13. R. J. Leduc and W. M. Wonham. PLC implementation of a DES supervisor for a manufacturing testbed. In Proc. 33rd Allerton Conf. Communication, Control and Computing, pages 519-528, Monticello, Illinois, Oct. 1995.
14. P. Malik. From Supervisory Control to Nonblocking Controllers for Discrete Event Systems. PhD thesis, University of Kaiserslau tern, Kaiserslautern, Germany, 2003.
15. R. Malik. On the set of certain conflicts of a given language. In Proc. 7th Int. Workshop on Discrete Event Systems, WODES '04, Reims, Prance, Sept. 2004.
16. R. Malik and R. Mühlfeld. A case study in verification of UML statecharts: the PROFIsafe protocol. J. Universal Computer Science, 9(2):138-151, 2003.
17. K. L. McMillan. Symbolic Model Checking. Kluwer, 1993.
18. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer, 1980.
19. V. Natarajan and R. Cleaveland. Divergence and fair testing. In Proc. 22nd Int. Colloquium on Automata, Languages, and Programming, ICALP '95, pages 648-659, 1995.
20. R. D. Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Comput. Sci., 34(1-2):83-133, 1984.
21. P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. Proc. IEEE, 77(1):81-98, Jan. 1989.
22. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1997.
23. R. J. van Glabbeek. The linear time - branching time spectrum I: The semantics of concrete, sequential processes. In J. A. Bergstra, A. Ponse, and S. A. Smolka, editors, Handbook of Process Algebra, pages 3-99. Elsevier, 2001.
24. K. C. Wong, J. G. Thistle, R. P. Malhame, and H.-H. Hoang. Supervisory control of distributed systems: Conflict resolution. Discrete Event Dynamic Systems: Theory and Applications, 10:131-186, 2000.
25. K. C. Wong and W. M. Wonham. Modular control and coordination of discrete-event systems. Discrete-Event Dynamic Systems: Theory and Applications, 8(3):247-297, Oct. 1998.
26. W. M. Wonham. 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".
27. Z. H. Zhang and W. M. Wonham. STCT: An efficient algorithm for supervisory control design. In B. Caillaud, P. Darondeau, L. Lavagno, and X. Xie, editors, Synthesis and Control of Discrete Event Systems, pages 77-100. Kluwer, 2002.