2013/06/11 by Kai Cai, Renyuan Zhang, Cai, Kai +3
Computer Science · #Distributed systems and fault tolerance #FOS: Electrical engineering #Formal Methods in Verification #Petri Nets in System Modeling #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1306.2422
openalex publication_date 2013/06/11 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28
We identify a new observability concept, called relative observability, in\nsupervisory control of discrete-event systems under partial observation. A\nfixed, ambient language is given, relative to which observability is tested.\nRelative observability is stronger than observability, but enjoys the important\nproperty that it is preserved under set union; hence there exists the supremal\nrelatively observable sublanguage of a given language. Relative observability\nis weaker than normality, and thus yields, when combined with controllability,\na generally larger controlled behavior; in particular, no constraint is imposed\nthat only observable controllable events may be disabled. We design algorithms\nwhich compute the supremal relatively observable (and controllable) sublanguage\nof a given language, which is generally larger than the normal counterparts. We\ndemonstrate the new observability concept and algorithms with a Guideway and an\nAGV example.\n