# Search results for: Eike Best

Acta Informatica > 2018 > 55 > 7 > 575-611

Information and Computation > 2017 > 253 > P3 > 399-410

Information Processing Letters > 2016 > 116 > 6 > 423-427

Lecture Notes in Computer Science > STACS 93 > 130-140

*k*on each place can be separated into

*k*sequences, each transforming one

*k*-th of the original marking. We prove that such a separation is possible for marked graph Petri nets, and present an inseparable sequence for a free-choice net.