### Skapa referens, olika format (klipp och klistra)

**Harvard**

Falkman, P. och Lennartson, B. (2001) *Combined Process Algebra and Petri Nets for Specification of Resource Booking Problems*.

** BibTeX **

@conference{

Falkman2001,

author={Falkman, Petter and Lennartson, Bengt},

title={Combined Process Algebra and Petri Nets for Specification of Resource Booking Problems},

booktitle={Proceedings 2001 IEEE American Control Conference, ARLINGTON, VA. JUN 25-27, 2001 },

isbn={0-7803-6495-3},

pages={4949-4955},

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

year={2001},

keywords={discrete event systems; Petri nets; process algebra; routing specifications; resource booking },

}

** RefWorks **

RT Conference Proceedings

SR Print

ID 15018

A1 Falkman, Petter

A1 Lennartson, Bengt

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

YR 2001

T2 Proceedings 2001 IEEE American Control Conference, ARLINGTON, VA. JUN 25-27, 2001

SN 0-7803-6495-3

SP 4949

OP 4955

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

LA eng

OL 30