TAPAAL and Reachability Analysis of P/T Nets-Reference-Cited by-同舟云学术

TAPAAL and Reachability Analysis of P/T Nets

Published:2016 Issue: Volume: Page:307-318
ISSN:0302-9743
Container-title:Transactions on Petri Nets and Other Models of Concurrency XI
language:
Short-container-title:

Author:

Jensen Jonas F.,Nielsen Thomas,Oestergaard Lars K.,Srba Jiří

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-53401-4_16

Reference15 articles.

1. Lecture Notes in Computer Science;M Andersen,2013

2. Berkelaar, M., Eikland, K., Notebaert, P.: lp_solve 5.5, open source (mixed-integer) linear programming system. Software, 1 May 2004. http://lpsolve.sourceforge.net/5.5

3. Lecture Notes in Computer Science;A David,2003

4. Lecture Notes in Computer Science;A David,2012

5. David, A., Jacobsen, L., Jacobsen, M., Srba, J.: A forward reachability algorithm for bounded timed-arc Petri nets. In: SSV 2012, vol. 102, EPTCS, pp. 125–140. Open Publishing Association (2012)

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

1. Methods for Efficient Unfolding of Colored Petri Nets;Fundamenta Informaticae;2023-10-26

2. CGAAL: Distributed On-The-Fly ATL Model Checker with Heuristics;Electronic Proceedings in Theoretical Computer Science;2023-09-30

3. Kaki: Efficient Concurrent Update Synthesis for SDN;Formal Aspects of Computing;2023-09-30

4. Kaki: Concurrent Update Synthesis for Regular Policies via Petri Games;Lecture Notes in Computer Science;2022

5. Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking;Lecture Notes in Computer Science;2022