 |
|
|
|
| HAL: hal-00003393, version 1 |
| Detailed view |  Export this paper |
|
|
| 4th International Conference on Application of Concurrency to System Design, Hamilton : Canada (2004) |
|
|
|
|
| Modular Analysis of Systems Composed of Semiautonomous Subsystems |
|
|
| Charles Lakos 1Laure Petrucci 2 |
|
|
| (2004) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | University of Adelaide, Department of Computer Science |
|
|
|
University of Adelaide |
|
|
| 2: | Laboratoire d'informatique de Paris-nord (LIPN) |
|
|
|
CNRS : UMR7030 РUniversit̩ Paris XIII - Paris Nord |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Other |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00003393, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00003393 | |
| oai:hal.archives-ouvertes.fr:hal-00003393 | |
| From: Laure Petrucci | |
| Submitted on: Monday, 29 November 2004 10:34:25 | |
| Updated on: Thursday, 6 July 2006 02:10:15 | |
