54 citations · 213 across the 36 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.OC2016★ 10 cited
On a Distributed Computation of Supervisors in Modular Supervisory Control
Jan Komenda, Tomáš Masopust, J. H. van Schuppen
In this paper, we discuss a supervisory control problem of modular discrete-event systems that allows for a distributed computation of supervisors. We provide a characterization an…
cs.FL2016★ 25 cited
Complexity of Universality and Related Problems for Partially Ordered NFAs
Markus Krötzsch, Tomáš Masopust, Michaël Thomazo
Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form o…
cs.FL2016★ 7 cited
Piecewise Testable Languages and Nondeterministic Automata
Tomáš Masopust
A regular language is -piecewise testable if it is a finite boolean combination of languages of the form , where and . Gi…