Branching time controllers for discrete event systems

P. Madhusudan, P.S. Thiagarajan
2002 Theoretical Computer Science  
We study the problem of synthesizing controllers for discrete event systems in a branching time framework. We use a class of labelled transition systems to model both plants and speciÿcations. We use ÿrst simulations and later bisimulations to capture the role of a controller; the controlled behaviour of the plant should be related via a simulation (bisimulation) to the speciÿcation. For both simulations and bisimulations we show that the problem of checking if a pair of ÿnite transition
more » ... -one modelling the plant and the other the speciÿcation -admits a controller is decidable in polynomial time. We also show that the size of the controller, if one exists, can be bounded by a polynomial in the sizes of the plant and the speciÿcation and can be e ectively constructed in polynomial time. Finally, we prove that in the case of simulations, the problem of checking for the existence of a controller is undecidable in a natural concurrent setting. .in (P.S. Thiagarajan). 1 This research was sponsored by the IFCPAR project 1502-1. 0304-3975/02/$ -see front matter c 2002 Published by Elsevier Science B.V. PII: S 0 3 0 4 -3 9 7 5 ( 0 0 ) 0 0 3 0 7 -8
doi:10.1016/s0304-3975(00)00307-8 fatcat:xyulomptczfmre2pqlefm254nm