Abstract
Given a Rabin automaton, we consider the problem of computing the fair controllability subset of states, which consists of those states from which the automaton can be guided by a’ fair’ controller to meet the acceptance condition of the automaton. The problem is investigated with respect to three notions of fairness, namely, impartiality, justice and fairness. By relating fair controllability to the existence of certain types of strongly connected components, we propose a graph-theoretic approach, which runs in polynomial time, for solving the problem with respect to all three fairness notions. A matching PTIME-hardness result is also shown.
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
Hart, S., Sharir, M. and Pnueli, A., (1983). Termination of probabilistic concurrent programs, ACM Trans, on Programming Languages and Systems, 5: 356–380.
Jones, N. and Laaser, W., (1977). Complete problems for deterministic polynomial time, Theoret. Comput. Sci., 3: 105–117.
Ramadge, P. and Wonham, W., (1989). The control of discrete event systems, Proc. IEEE, 77(1): 81–98.
Thistle, J., (1995). On control of systems modeled as deterministic Rabin automata, Discrete Event Dynamic Systems: Theory and Applications, 5(4): 357–381.
Thistle, J. and Malhamé, R., (1998). Control of ω-automata under state fairness assumptions, Systems and Control Letters, 33: 265–274.
Thistle, J. and Wonham, W., (1994). Control of infinite behavior of finite automata, SIAM J. Control and Optimization, 32(4): 1075–1097.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Yen, HC. (2000). Fair Control of ω-Automata. In: Boel, R., Stremersch, G. (eds) Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol 569. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4493-7_37
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4493-7_37
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7025-3
Online ISBN: 978-1-4615-4493-7
eBook Packages: Springer Book Archive