Characterising Petri Net Solvable Binary Words-Reference-Cited by-同舟云学术

Characterising Petri Net Solvable Binary Words

Published:2016 Issue: Volume: Page:39-58
ISSN:0302-9743
Container-title:Application and Theory of Petri Nets and Concurrency
language:
Short-container-title:

Author:

Best Eike,Erofeev Evgeny,Schlachter Uli,Wimmel Harro

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-39086-4_4

Reference10 articles.

1. Badouel, É., Bernardinello, L., Darondeau, P.: Petri Net Synthesis, 339 p. Springer, Heidelberg (2015). ISBN 978-3-662-47966-7

2. Barylska, K., Best, E., Erofeev, E., Mikulski, Ł., Piątkowski, M.: On binary words being Petri net solvable. In: Carmona, J., Bergenthum, R., van der Aalst, W. (eds) Proceedings of the ATAED 2015, pp. 1–15 (2015). http://ceur-ws.org/Vol1371

3. Best, E., Devillers, R.: Synthesis of bounded choice-free Petri nets. In: Aceto, L., Frutos Escrig, D. (eds) Proceedings of the 26th International Conference on Concurrency Theory (CONCUR 2015), LIPICS, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, pp. 128-141 (2015). doi: 10.4230/LIPIcs.CONCUR.2015.128

4. Lecture Notes in Computer Science;E Best,2014

5. Caillaud, B.: http://www.irisa.fr/s4/tools/synet/

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

1. Target-oriented Petri Net Synthesis;Fundamenta Informaticae;2020-09-28

2. Presynthesis of bounded choice-free or fork-attribution nets;Information and Computation;2020-04

3. Generating all minimal petri net unsolvable binary words;Discrete Applied Mathematics;2020-03

4. Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach;Transactions on Petri Nets and Other Models of Concurrency XIV;2019

5. A Geometric Characterisation of Event/State Separation;Application and Theory of Petri Nets and Concurrency;2018