### 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.nil | b.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.

Original language | Undefined |
---|---|

Pages (from-to) | 169-179 |

Number of pages | 11 |

Journal | Theoretical computer science |

Volume | 124 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1994 |

### Keywords

- IR-18270
- METIS-118790
- EWI-8252

## Cite this

Goltz, U., & Rensink, A. (1994). Finite petri nets as models for recursive causal behaviour.

*Theoretical computer science*,*124*(1), 169-179. https://doi.org/10.1016/0304-3975(94)90058-2