### Abstract

We study the problem of synthesising controllers for discrete event systems. Traditionally this problem is tackled in a linear time setting. Moreover, the desired subset of the computations of the uncontrolled system (often called a plant) is specified by automata theoretic means. Here we formulate the problem in a branching time framework. We use a class of labelled transition systems to model both the plant and the specification. We deploy behaviour preserving morphisms to capture the role of a controller; the controlled behaviour of the plant should be related via a behaviour preserving morphism to the specification at the level of unfoldings. One must go over to unfoldings in order to let the controller use memory of the past to carry out its function. We show that the problem of checking if a pair of finite transition systems - one modelling the plant and the other the specification - admits a controller is decidable in polynomial time. We also show the size of the finite controller, if one exists can be bounded by a polynomial in the sizes of the plant and the specification. Such a controller can also be effectively constructed. We then prove that in a natural concurrent setting, the problem of checking for the existence of a (finite) controller is undecidable.

Original language | English (US) |
---|---|

Title of host publication | CONCUR 1998 Concurrency Theory - 9th International Conference, Proceedings |

Editors | Davide Sangiorgi, Robert de Simone |

Publisher | Springer-Verlag |

Pages | 18-33 |

Number of pages | 16 |

ISBN (Print) | 9783540648963 |

State | Published - Jan 1 1998 |

Externally published | Yes |

Event | 9th International Conference on Concurrency Theory, CONCUR 1998 - Nice, France Duration: Sep 8 1998 → Sep 11 1998 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1466 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 9th International Conference on Concurrency Theory, CONCUR 1998 |
---|---|

Country | France |

City | Nice |

Period | 9/8/98 → 9/11/98 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Controllers for discrete event systems via morphisms'. Together they form a unique fingerprint.

## Cite this

*CONCUR 1998 Concurrency Theory - 9th International Conference, Proceedings*(pp. 18-33). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1466). Springer-Verlag.