Combined process algebra and Petri nets for specification of resource booking problems

Author

Falkman, Petter ; Lennartson, Bengt

Author_Institution

Dept. of Signals & Syst., Chalmers Univ. of Technol., Goteborg, Sweden

Volume

6

fYear

2001

fDate

2001

Firstpage

4949

Abstract

A modeling framework for general routing and resource booking problems is presented. The task is to specify desired routes for individual objects (products, data packets, vehicles), which are to be served by a number of shared resources (machines, computers, communication links). A high level language is presented in order to simplify the specification of desired routes. This modeling language combines Petri nets and process algebra. Process operators are introduced for specification of sequences, alternative choices, arbitrary ordered sequences and process synchronization. Multiple as well as alternative resources are easily specified utilizing sets of resources. These sets and operators imply a very compact and efficient representation of complex routing specifications. In fact, the representation is suitable for verification and synthesis based on symbolic tools such as binary decision diagrams

Keywords

Petri nets; computer aided production planning; discrete event systems; formal specification; process algebra; production control; resource allocation; Petri nets; discrete event systems; flexible production system; formal specification; process algebra; production control; resource booking; routing specifications; Algebra; Automatic control; Automation; Boolean functions; Communication system control; Data structures; Discrete event systems; Petri nets; Power system modeling; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 2001. Proceedings of the 2001

Conference_Location

Arlington, VA

ISSN

0743-1619

Print_ISBN

0-7803-6495-3

Type

conf

DOI

10.1109/ACC.2001.945769

Filename

945769