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

**Harvard**

Falkman, P., Lennartson, B. och Tittus, M. (2009) *Specification of a Batch Plant using Process Algebra and Petri Nets*.

** BibTeX **

@article{

Falkman2009,

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

title={Specification of a Batch Plant using Process Algebra and Petri Nets},

journal={Control Engineering Practice},

issn={0967-0661},

volume={17},

issue={9},

pages={1004-15},

abstract={The focus of the present paper is on the specification of routing and resource allocation systems. Such systems can be described as a set of shared resources and a set of products. The products utilize the resources in order to be manipulated according to a certain specification. This product specification consists of a set of operations that are to be executed in a certain order by specific resources. This results in a desired product route through the resource system, and hence the product specification is also called a routing specification. The process algebra petri net (PPN) formalism, i.e. a combination of petri nets and process algebra, implies efficient and less complex models for routing specifications compared to PNs and automata descriptions. The aim of this paper is to show how the PPN language can be used in order to simplify the specification of desired routes of the chemical batch process.},

year={2009},

}

** RefWorks **

RT Journal Article

SR Electronic

ID 108778

A1 Falkman, Petter

A1 Lennartson, Bengt

A1 Tittus, Michael

T1 Specification of a Batch Plant using Process Algebra and Petri Nets

YR 2009

JF Control Engineering Practice

SN 0967-0661

VO 17

IS 9

SP 1004

OP 15

AB The focus of the present paper is on the specification of routing and resource allocation systems. Such systems can be described as a set of shared resources and a set of products. The products utilize the resources in order to be manipulated according to a certain specification. This product specification consists of a set of operations that are to be executed in a certain order by specific resources. This results in a desired product route through the resource system, and hence the product specification is also called a routing specification. The process algebra petri net (PPN) formalism, i.e. a combination of petri nets and process algebra, implies efficient and less complex models for routing specifications compared to PNs and automata descriptions. The aim of this paper is to show how the PPN language can be used in order to simplify the specification of desired routes of the chemical batch process.

LA eng

DO 10.1016/j.conengprac.2009.03.006

LK http://dx.doi.org/10.1016/j.conengprac.2009.03.006

OL 30