diff options
| author | Adam Stück <adam@adast.xyz> | 2023-03-25 15:19:32 +0100 |
|---|---|---|
| committer | Adam Stück <adam@adast.xyz> | 2023-03-25 16:50:27 +0100 |
| commit | ce742445317258ab667e9c5fc1b1091cc0e64b98 (patch) | |
| tree | be0125750fe8ce69396fee25a793f132060a025f /src/resume-da.md | |
| parent | 77d8160ff328e0183ca37b1494b2f679506c0b21 (diff) | |
resume: add publications
Diffstat (limited to 'src/resume-da.md')
| -rw-r--r-- | src/resume-da.md | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/src/resume-da.md b/src/resume-da.md index 8f5da75..9cf7d48 100644 --- a/src/resume-da.md +++ b/src/resume-da.md @@ -1,3 +1,5 @@ +<script type="text/javascript" language="javascript" src="js/showhide.js"></script> + #### [ [English](/resume) / Dansk ] # Adam Stück @@ -72,6 +74,29 @@ * Kandidat i Datalogi - 2-årig uddannelse <small>(undervejs)</small> * Bachelor i Datalogi - 3-årig uddannelse +## Publikationer + +[1] **Potency-Based Heuristic Search with Randomness for Explicit Model Checking**<br> +by E.G.Henriksen, A.M. Khorsid, E. Nielsen, Th. Risager, [J. Srba](http://www.cs.aau.dk/~srba), **A.M. Stück**, S. Sørensen<br> +In Proceedings of the 29th International SPIN Symposium on Model Checking of Software (SPIN'23), LNCS, pages 1--8, Springer-Verlag, 2023.<br> +*To appear.*<br> +[PDF](http://www.cs.aau.dk/~srba/files/HKNRSSS:SPIN:23.pdf) [BibTex](https://homes.cs.aau.dk/~srba/srba.html#HKNRSSS:SPIN:23) + <a onclick="ShowHide('HKNRSSS:SPIN:23');UpdateText(this);" href="javascript:void(0)">Abstract</a> + +<div class="abstract" style="display:none" id="HKNRSSS:SPIN:23">Efficient state-space exploration +has a significant impact on reachability analysis in explicit model checking +and existing tools use several variants of search heuristics and random walks +in order to overcome the state-space explosion problem. We contribute with a +novel approach based on a random search strategy, where actions are assigned +dynamically (on-the-fly) updated potencies, changing according to the +variations of a heuristic distance to the goal configuration as encountered +during the state-space search. We implement our general idea into a Petri net +model checker TAPAAL and document its efficiency on a large benchmark of Petri +net models from the annual Model Checking Contest. The experiments show that +our heuristic search outperforms the standard search approaches in multiple +metrics and that it constitutes a worthy addition to the portfolio of classical +search strategies. </div> + ## Konkurrencer * 2022: Senior Qualifier i De Danske Cybermesterskaber |