论文信息 - Early termination by local string in incremental language containment tests

Early termination by local string in incremental language containment tests

Abstract We investigate an incremental form of the two well-known language containment tests, verification of controllability and general language inclusion. An incremental algorithm is presented where in each verification cycle the results of previous rounds may be used for more efficient computation. Furthermore, we investigate reachability by local strings to allow early termination if it can be demonstrated that a test is bound to fail in the future.

Bengt Lennartson | Martin Fabian | Arash Vahidi

[1] Ryan J. Leduc,et al. Hierarchical Interface-based Supervisory Control , 2003 .

[2] P. Ramadge,et al. Modular Supervisory Control of Discrete Event Systems , 1988 .

[3] Bruce H. Krogh,et al. Synthesis of feedback control logic for a class of controlled Petri nets , 1990 .

[4] Knut Åkesson,et al. Exploiting Modularity for Synthesis and Verification of Supervisors , 2002 .

[5] S. Marcus,et al. On controllability and normality of discrete event dynamical systems , 1991 .

[6] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[7] Bengt Lennartson,et al. Efficient supervisory synthesis of large systems , 2004 .

[8] P. Ramadge,et al. Supervisory control of a class of discrete event processes , 1987 .

[9] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[10] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.