# Complexity of Verifying Nonblockingness in Modular Supervisory Control

## TL;DR

This paper explores the computational complexity of verifying nonblockingness in modular supervisory control of discrete event systems, integrating complexity theory results to establish new insights.

## Contribution

It introduces novel complexity results specific to nonblockingness verification in modular supervisory control, connecting complexity theory with supervisory control challenges.

## Key findings

- New complexity bounds for nonblockingness verification
- Illustration of complexity theory relevance to supervisory control
- Enhanced understanding of verification difficulty in modular systems

## Abstract

Complexity analysis becomes a common task in supervisory control. However, many results of interest are spread across different topics. The aim of this paper is to bring several interesting results from complexity theory and to illustrate their relevance to supervisory control by proving new nontrivial results concerning nonblockingness in modular supervisory control of discrete event systems modeled by finite automata.