A Graph-Theoretical Characterisation of State Separation-Reference-Cited by-同舟云学术

A Graph-Theoretical Characterisation of State Separation

Published:2017 Issue: Volume: Page:163-175
ISSN:0302-9743
Container-title:SOFSEM 2017: Theory and Practice of Computer Science
language:
Short-container-title:

Author:

Best Eike,Devillers Raymond,Schlachter Uli

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-51963-0_13

Reference9 articles.

1. Badouel, É., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Texts in Theoretical Computer Science, 339 pages. Springer, Heidelberg (2015). ISBN 978-3-662-47967-4

2. Berge, C.: Graphs and Hypergraphs. North Holland Mathematical Library, Vol. 6, 528 pages. Elsevier, Oxford (1973)

3. Best, E., Darondeau, P.: A decomposition theorem for finite persistent transition systems. Acta Informatica 46, 237–254 (2009)

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

5. Darondeau, P.: Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent petri nets. Inf. Process. Lett. 94, 241–245 (2005)

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

1. Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory;Fundamenta Informaticae;2022-01-10

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

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

4. Automated Repair of Process Models Using Non-local Constraints;Application and Theory of Petri Nets and Concurrency;2020

5. A New Property of Choice-Free Petri Net Systems;Application and Theory of Petri Nets and Concurrency;2020