Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Kiviriga, Andrej"'
Autor:
Kiviriga, Andrej
Publikováno v:
Kiviriga, A 2023, Efficient Model Checking: The Power of Randomness . Ph.d.-serien for Det Tekniske Fakultet for IT og Design, Aalborg Universitet, Aalborg Universitetsforlag .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1266::881699f4ad490b273f9c27e3f318d6e4
https://vbn.aau.dk/ws/files/534292082/PHD_AK.pdf
https://vbn.aau.dk/ws/files/534292082/PHD_AK.pdf
Publikováno v:
Kiviriga, A, Larsen, K G & Nyman, U 2022, ' Randomized reachability analysis in UPPAAL: fast error detection in timed systems* ', International Journal on Software Tools for Technology Transfer, vol. 24, no. 6, pp. 1025-1042 . https://doi.org/10.1007/s10009-022-00681-z
Randomized reachability analysis is an efficient method for detection of safety violations. Due to the under-approximate nature of the method, it excels at quick falsification of models and can greatly improve the model-based development process: usi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1003e5cfa93e1fc4adf8d9f5bc8c13a4
https://vbn.aau.dk/da/publications/f9ba9f59-7aae-4c29-8e19-2546583a41f6
https://vbn.aau.dk/da/publications/f9ba9f59-7aae-4c29-8e19-2546583a41f6
Autor:
Jensen, Peter Gjøl, Kiviriga, Andrej, Guldstrand Larsen, Kim, Nyman, Ulrik, Mijačika, Adriana, Høiriis Mortensen, Jeppe
Publikováno v:
Jensen, P G, Kiviriga, A, Guldstrand Larsen, K, Nyman, U, Mijačika, A & Høiriis Mortensen, J 2022, Monte Carlo Tree Search for Priced Timed Automata . in E Ábrahám & M Paolieri (eds), Quantitative Evaluation of Systems : 19th International Conference, QEST 2022, Proceedings . Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13479 LNCS, pp. 381-398, 19th International Conference on Quantitative Evaluation of Systems, QEST 2022, Warsaw, Poland, 12/09/2022 . https://doi.org/10.1007/978-3-031-16336-4_19
Priced timed automata (PTA) were introduced in the early 2000s to allow for generic modelling of resource-consumption problems for systems with real-time constraints. Optimal schedules for allocation of resources may here be recast as optimal reachab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::09587a5c3e3aeb0ecb89ea535f808032
https://vbn.aau.dk/ws/files/493737469/2022_QEST_Nyman.pdf
https://vbn.aau.dk/ws/files/493737469/2022_QEST_Nyman.pdf
Publikováno v:
Kiviriga, A, Larsen, K G & Nyman, U 2021, Randomized Reachability Analysis in Uppaal : Fast Error Detection in Timed Systems . in A Lluch Lafuente & A Mavridou (eds), Formal Methods for Industrial Critical Systems : 26th International Conference, FMICS 2021, Proceedings . Springer Science+Business Media, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12863 LNCS, pp. 149-166, 26th International Conference on Formal Methods for Industrial Critical Systems, FMICS 2021, Virtual, Online, 24/08/2021 . https://doi.org/10.1007/978-3-030-85248-1_9
We introduce Randomized Reachability Analysis – an efficient and highly scalable method for detection of “rare event” states, such as errors. Due to the under-approximate nature of the method, it excels at quick falsification of models and can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a32e8062170652e53fb4fa9260d847ba
https://vbn.aau.dk/ws/files/457949216/2021_FMICS_Randomized_Reachability_Analysis.pdf
https://vbn.aau.dk/ws/files/457949216/2021_FMICS_Randomized_Reachability_Analysis.pdf
Publikováno v:
Kiviriga, A, Larsen, K G & Nyman, U 2020, Randomized Refinement Checking of Timed I/O Automata . in J Pang & L Zhang (eds), Proceedings of SETTA 2020 : Dependable Software Engineering. Theories, Tools, and Applications . Springer, Lecture Notes in Computer Science, vol. 12153, pp. 70-88, International Symposium on Dependable Software Engineering: Theories, Tools, and Applications (SETTA 2020), Guangzhou, China, 24/11/2020 . https://doi.org/10.1007/978-3-030-62822-2_5
To combat the state-space explosion problem and ease system development, we present a new refinement checking (falsification) method for Timed I/O Automata based on random walks. Our memory-less heuristics Random Enabled Transition (RET) and Random C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::85210a433dee09dd5f356bd223b62bf0
https://vbn.aau.dk/da/publications/3fd69a2c-7a88-4ef9-b654-c89763e27054
https://vbn.aau.dk/da/publications/3fd69a2c-7a88-4ef9-b654-c89763e27054