Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
Inference of finite automata using homing sequences
Information and Computation
On the learnability of infinitary regular sets
Information and Computation
Learning approximately regular languages with reversible languages
Theoretical Computer Science
Efficient learning of typical finite automata from random walks
Information and Computation
Model checking
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
| Hi-index | 0.00 |
We propose an algorithm for thesynthesis of supervisors in discrete event systems. The algorithmis based on a learning algorithm of regular languages proposedby Angluin, and constructs a supervisor realizing an unknownspecification which is identified through the interaction betweenthe designer and the algorithm. We also consider the synthesisproblem for systems consisting of several processes which behaveconcurrently. One of serious problems in dealing with such aconcurrent system is that the number of states required for describingthe global behavior often grows exponentially in the size ofthe model. To improve this situation, we introduce the conceptof dependency defined on the set of events. It prevents the algorithmfrom considering all interleavings of independent occurrencesof events.