54 citations · 213 across the 36 of their papers we have counts for
6 papers · 1 filter
On -piecewise testability (preliminary report)
Tomáš Masopust, Michaël Thomazo
For a non-negative integer , a language is -piecewise test\-able (-PT) if it is a finite boolean combination of languages of the form for…
Alternating Towers and Piecewise Testable Separators
Štěpán Holub, Tomáš Masopust, Michaël Thomazo
Two languages are separable by a piecewise testable language if and only if there exists no infinite tower between them. An infinite tower is an infinite sequence of strings altern…
A Note on Relative Observability in Coordination Control
Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Relative observability has been introduced and studied in the framework of partially observed discrete-event systems as a condition stronger than observability, but weaker than nor…
On Upper and Lower Bounds on the Length of Alternating Towers
Štěpán Holub, Galina Jirásková, Tomáš Masopust
A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the ot…
Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control
Jan Komenda, Tomáš Masopust
In this paper we present a new approach to decentralized supervisory control of large automata with communicating supervisors. We first generalize the recently developed top-down a…
Maximally Permissive Coordination Supervisory Control -- Towards Necessary and Sufficient Conditions
Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
In this paper, we further develop the coordination control framework for discrete-event systems with both complete and partial observation. A new weaker sufficient condition for th…