Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows-Reference-Cited by-同舟云学术

Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows

Published:2013 Issue: Volume: Page:330-348
ISSN:0302-9743
Container-title:Application and Theory of Petri Nets and Concurrency
language:
Short-container-title:

Author:

Bergenthum Robin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-38697-8_18

Reference35 articles.

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs (1993)

2. Baumgarten, B.: Petri-Netze: Grundlagen und Anwendungen. Spektrum, Heidelberg (1996)

3. Bergenthum, R.: Algorithmen zur Verifikation von halbgeordneten Petrinetz-Abläufen: Implementierung und Anwendungen. Diplomarbeit, Katholische Universität Eichstätt-Ingolstadt (2006)

4. Lecture Notes in Computer Science;R. Bergenthum,2006

5. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri Nets from Finite Partial Languages. Fundamenta Informaticae 88(4), 437–468 (2008)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Token Trail Semantics II - Petri Nets And Their Net Language;Lecture Notes in Computer Science;2024

2. Firing Partial Orders in a Petri Net;Application and Theory of Petri Nets and Concurrency;2021

3. Prime Miner - Process Discovery using Prime Event Structures;2019 International Conference on Process Mining (ICPM);2019-06

4. Synthesizing Petri Nets from Hasse Diagrams;Lecture Notes in Computer Science;2017

5. Verification of Scenarios in Petri Nets Using Compact Tokenflows;Fundamenta Informaticae;2015