Modular analysis of systems composed of semiautonomous subsystems

Author

Lakos, Charles ; Petrucci, Laure

Author_Institution

Dept. of Comput. Sci., Adelaide Univ., SA, Australia

fYear

2004

fDate

16-18 June 2004

Firstpage

185

Lastpage

194

Abstract

This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factory automation systems. It presents new algorithms to harness this modular analysis in the determination of reachable states with specified partial markings, to determine possible deadlocks, both global and local, and also liveness. These algorithms have been implemented in a prototype tool which has then been used to solve a problem in factory automation which, even for relatively simple configurations, can lead to state spaces beyond the capabilities of many analysis tools.

Keywords

Petri nets; concurrency control; distributed algorithms; factory automation; production engineering computing; reachability analysis; state-space methods; Petri nets; deadlocks; factory automation systems; modular analysis; partial markings; prototype tool; reachable states; semiautonomous subsystems; state spaces; Algorithm design and analysis; Automatic control; Computer science; Control systems; Manufacturing automation; Production facilities; Prototypes; State-space methods; System recovery; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Application of Concurrency to System Design, 2004. ACSD 2004. Proceedings. Fourth International Conference on

Print_ISBN

0-7695-2077-4

Type

conf

DOI

10.1109/CSD.2004.1309131

Filename

1309131