Deterministic finite capacity automata: a solution to reduce the complexity of modeling and control of automated manufacturing systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

The solution complexity of a synthesized control model of an automated manufacturing system grows exponentially in the number of constituent components in the system [6], thus resulting in the control model being either theoretically untractable in computation [12] or practically unfeasible in implementation [1,14]. By taking advantage of both Petri nets and supervisory control theory, this paper presents a new methodology, called deterministic finite capacity automaton, which when used to model the control of an automated manufacturing system can significantly reduce model complexity. By taking into account the nature of manufacturing automation and combining the technology advances in multi-process computer operating systems, an automaton-based control model capable of running coordinated computing processes is defined. An adjustable language is introduced into the control model, to make it function more efficiently.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Symposium on Computer-Aided Control System Design
Editors Anon
Pages218-223
Number of pages6
StatePublished - 1996
EventProceedings of the 1996 IEEE International Symposium on Computer-Aided Control System Design - Dearborn, MI, USA
Duration: Sep 15 1996Sep 18 1996

Other

OtherProceedings of the 1996 IEEE International Symposium on Computer-Aided Control System Design
CityDearborn, MI, USA
Period9/15/969/18/96

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Deterministic finite capacity automata: a solution to reduce the complexity of modeling and control of automated manufacturing systems'. Together they form a unique fingerprint.

Cite this