Paper Info
Title
Combined Process Algebra And Petri Nets For Specification Of Resource Booking Problems
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
DOI
Venue
2001
10.1109/ACC.2001.945769
PROCEEDINGS OF THE 2001 AMERICAN CONTROL CONFERENCE, VOLS 1-6
Keywords
DocType
ISSN
discrete event systems, Petri nets, process algebra, routing specifications, resource booking
Conference
0743-1619
Citations 
PageRank 
References 
2
0.55
3
Authors
2
Name
Order
Citations
PageRank
Petter Falkman14610.37
Bengt Lennartson2934118.87