Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
Theoretical Computer Science - Special volume on Petri nets
Communication and Concurrency
Bisimulation indexes and their applications
Theoretical Computer Science
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines
Discrete Event Dynamic Systems
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
Bisimulation relations for dynamical, control, and hybrid systems
Theoretical Computer Science
Bisimulation relations for weighted automata
Theoretical Computer Science
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Automatica (Journal of IFAC)
Hi-index | 22.15 |
In this paper, the bisimilarity control of discrete event systems (DESs) under partial observations is investigated, where the plant and the specification are allowed to be nondeterministic. A notation of simulation-based controllability and a synchronization scheme for the supervised system are formalized based on the simulation relation between the specification and the plant. It is shown that the existence of bisimilarity supervisors is characterized by the notions of the simulation-based controllability and the language observability, which extends the traditional results of supervisory control from language equivalence to bisimulation equivalence. In addition, a polynomial algorithm to test the simulation-based controllability is developed by constructing a computing tree. This algorithm together with the test of language observability can be used to check the existence of bisimilarity supervisors.