A note on deciding the controllability of a language K with respect to a language L
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 38 (4) , 658-662
- https://doi.org/10.1109/9.250543
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Asynchronous dynamical systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On Petri net models of infinite state supervisorsIEEE Transactions on Automatic Control, 1992
- Synthesis of feedback control logic for a class of controlled Petri netsIEEE Transactions on Automatic Control, 1990
- Undecidability results for deterministic communicating sequential processesIEEE Transactions on Automatic Control, 1990
- Finitely recursive process models for discrete event systemsIEEE Transactions on Automatic Control, 1988
- Modular Feedback Logic for Discrete Event SystemsSIAM Journal on Control and Optimization, 1987
- Supervisory Control of a Class of Discrete Event ProcessesSIAM Journal on Control and Optimization, 1987
- Modular Supervisory Control of Discrete Event SystemsPublished by Springer Nature ,1986
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984