CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Combined Process Algebra and Petri Nets for Specification of Resource Booking Problems

Petter Falkman (Institutionen för signaler och system, Reglerteknik och automation) ; Bengt Lennartson (Institutionen för signaler och system, Reglerteknik och automation)
Proceedings 2001 IEEE American Control Conference, ARLINGTON, VA. JUN 25-27, 2001 (0743-1619). Vol. 6 (2001), p. 4949-4955.
[Konferensbidrag, refereegranskat]

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 BDDs.

Nyckelord: discrete event systems; Petri nets; process algebra; routing specifications; resource booking

Denna post skapades 2006-09-12. Senast ändrad 2013-06-07.
CPL Pubid: 15018


Institutioner (Chalmers)

Institutionen för signaler och system, Reglerteknik och automation (1900-2004)


Information Technology

Chalmers infrastruktur