Boundedness analysis of finitely recursive processes. II. Sequential and hybrid processes

Author

Bose, Supratik ; Mukhopadhyay, Siddhartha ; Patra, Amit

Author_Institution

Dept. of Electr. Eng., Indian Inst. of Technol., Kharagpur, India

Volume

43

Issue

11

fYear

1998

fDate

11/1/1998 12:00:00 AM

Firstpage

1532

Lastpage

1542

Abstract

Part I of this paper has shown that a subclass of the finitely recursive processes (FRP), composed without the sequential composition operator (SCO), is bounded. In this sequel it is first shown that boundedness is not guaranteed but decidable for the subclass of FRP built using the SCO, but without the parallel composition operator (PCO). To overcome the limitation in modeling using the SCO only, some bounded hybrid subclasses have been proposed where both the SCO and PCO can be used, although in a restricted fashion. Finally, the proposed hybrid framework is used to model a job-shop, and its potential in the specification and design of supervisory control systems is demonstrated

Keywords

control system synthesis; decidability; discrete event systems; process algebra; production control; boundedness analysis; finitely recursive processes; hybrid processes; job-shop; sequential composition operator; sequential processes; supervisory control systems; Algebra; Career development; Costs; Discrete event systems; Equations; Fiber reinforced plastics; Information systems; Supervisory control;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.728870

Filename

728870