A decomposition theorem for finite persistent transition systems

Authors:
Eike Best;Philippe Darondeau
Affiliations:
Carl von Ossietzky Universität Oldenburg, Parallel Systems, Department of Computing Science, 26111, Oldenburg, Germany;INRIA, Centre Rennes-Bretagne Atlantique, Campus de Beaulieu, 35042, Rennes Cedex, France
Venue:
Acta Informatica
Year:
2009

Citing 0
Cited 2

Separability in persistent petri nets

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Separability in Persistent Petri Nets

Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider finite labelled transition systems. We show that if such transition systems are deterministic, persistent, and weakly periodic, then they can be decomposed in the following sense. There exists a finite set of label-disjoint cycles such that any other cycle is Parikh-equivalent to a multiset of cycles from this set.