Separability in conflict-free Petri nets

Eike Best; Javier Esparza; Harro Wimmel; Karsten Wolf

doi:10.1007/978-3-540-70881-0_1

Separability in conflict-free Petri nets

Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 Scopus citations

Abstract

We study whether transition sequences that transform markings with multiples of a number 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.

Original language	English
Title of host publication	Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference, PSI 2006, Revised Papers
Publisher	Springer Verlag
Pages	1-18
Number of pages	18
ISBN (Print)	9783540708803
DOIs	https://doi.org/10.1007/978-3-540-70881-0_1
State	Published - 2007
Externally published	Yes
Event	6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics, PSI 2006 - Novosibirsk, Russian Federation Duration: 27 Jun 2006 → 30 Jun 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4378 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics, PSI 2006
Country/Territory	Russian Federation
City	Novosibirsk
Period	27/06/06 → 30/06/06

Access to Document

10.1007/978-3-540-70881-0_1

Cite this

Best, E., Esparza, J., Wimmel, H., & Wolf, K. (2007). Separability in conflict-free Petri nets. In Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference, PSI 2006, Revised Papers (pp. 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4378 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-70881-0_1

Best, Eike ; Esparza, Javier ; Wimmel, Harro et al. / Separability in conflict-free Petri nets. Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference, PSI 2006, Revised Papers. Springer Verlag, 2007. pp. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ec3213a3d90d4cebb263ff0d8a976552,

title = "Separability in conflict-free Petri nets",

abstract = "We study whether transition sequences that transform markings with multiples of a number 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.",

author = "Eike Best and Javier Esparza and Harro Wimmel and Karsten Wolf",

year = "2007",

doi = "10.1007/978-3-540-70881-0_1",

language = "English",

isbn = "9783540708803",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--18",

booktitle = "Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference, PSI 2006, Revised Papers",

note = "6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics, PSI 2006 ; Conference date: 27-06-2006 Through 30-06-2006",

}

Best, E, Esparza, J, Wimmel, H & Wolf, K 2007, Separability in conflict-free Petri nets. in Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference, PSI 2006, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4378 LNCS, Springer Verlag, pp. 1-18, 6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics, PSI 2006, Novosibirsk, Russian Federation, 27/06/06. https://doi.org/10.1007/978-3-540-70881-0_1

Separability in conflict-free Petri nets. / Best, Eike; Esparza, Javier; Wimmel, Harro et al.
Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference, PSI 2006, Revised Papers. Springer Verlag, 2007. p. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4378 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Separability in conflict-free Petri nets

AU - Best, Eike

AU - Esparza, Javier

AU - Wimmel, Harro

AU - Wolf, Karsten

PY - 2007

Y1 - 2007

N2 - We study whether transition sequences that transform markings with multiples of a number 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.

AB - We study whether transition sequences that transform markings with multiples of a number 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.

UR - http://www.scopus.com/inward/record.url?scp=38049177508&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-70881-0_1

DO - 10.1007/978-3-540-70881-0_1

M3 - Conference contribution

AN - SCOPUS:38049177508

SN - 9783540708803

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 18

BT - Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference, PSI 2006, Revised Papers

PB - Springer Verlag

T2 - 6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics, PSI 2006

Y2 - 27 June 2006 through 30 June 2006

ER -

Best E, Esparza J, Wimmel H, Wolf K. Separability in conflict-free Petri nets. In Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference, PSI 2006, Revised Papers. Springer Verlag. 2007. p. 1-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-70881-0_1

Separability in conflict-free Petri nets

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this