Finite petri nets as models for recursive causal behaviour

Share/Save/Bookmark

Goltz, Ursula and Rensink, Arend (1994) Finite petri nets as models for recursive causal behaviour. Theoretical computer science, 124 (1). pp. 169-179. ISSN 0304-3975

open access
[img]
Preview
PDF - Published Version
734kB
Abstract:Goltz (1988) discussed whether or not there exist finite Petri nets (with unbounded capacities) modelling the causal behaviour of certain recursive CCS terms. As a representative example, the following term is considered:

B=(a.nilb.B)+c.nil.

We will show that the answer depends on the chosen notion of behaviour. It was already known that the interleaving behaviour and the branching structure of terms as B can be modelled as long as causality is not taken into account. We now show that also the causal behaviour of B can be modelled as long as the branching structure is not taken into account. However, it is not possible to represent both causal dependencies and the behaviour with respect to choices between alternatives in a finite net. We prove that there exists no finite Petri net modelling B with respect to both pomset trace equivalence and failure equivalence.
Item Type:Article
Copyright:© 1994 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/18270
Official URL:http://dx.doi.org/10.1016/0304-3975(94)90058-2
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 118790