Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Hendrik Maarand"'
Autor:
Hendrik Maarand, Tarmo Uustalu
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 246, Iss Proc. PLACES 2017, Pp 39-48 (2017)
Analyzing the behaviour of a concurrent program is made difficult by the number of possible executions. This problem can be alleviated by applying the theory of Mazurkiewicz traces to focus only on the canonical representatives of the equivalence cla
Externí odkaz:
https://doaj.org/article/079ed0d96bcd4eb8ac9c5696e763e8b2
Autor:
Hendrik Maarand, Hellis Tamm
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783031132568
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25f35d1470d40f3e46cf228559fe9952
https://doi.org/10.1007/978-3-031-13257-5_14
https://doi.org/10.1007/978-3-031-13257-5_14
Autor:
Hendrik Maarand, Tarmo Uustalu
Publikováno v:
Innovations in Systems and Software Engineering. 15:253-265
Mazurkiewicz traces are a generalization of strings where an independence relation on the alphabet for commutability of letters induces an equivalence relation on strings. The equivalence relation can be made more expressive by allowing the commutabi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2098f38b1a3a028d4fd6051bebb5097e
https://doi.org/10.1007/s11334-019-00347-1
https://doi.org/10.1007/s11334-019-00347-1
Autor:
Tarmo Uustalu, Hendrik Maarand
Publikováno v:
PLACES@ETAPS
Electronic Proceedings in Theoretical Computer Science, Vol 246, Iss Proc. PLACES 2017, Pp 39-48 (2017)
Electronic Proceedings in Theoretical Computer Science, Vol 246, Iss Proc. PLACES 2017, Pp 39-48 (2017)
Analyzing the behaviour of a concurrent program is made difficult by the number of possible executions. This problem can be alleviated by applying the theory of Mazurkiewicz traces to focus only on the canonical representatives of the equivalence cla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18f6b7e102f8b494abbd1b536067ff05
https://doi.org/10.4204/eptcs.246.8
https://doi.org/10.4204/eptcs.246.8
Autor:
Hendrik Maarand, Tarmo Uustalu
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 121:100677
We propose an operational semantics where the execution of instructions of a program is not necessarily in the order in which they are given in the program. In other words, an instruction might be executed before its preceding instructions have been
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11055df51598579b7c6c4eeb036c269c
https://doi.org/10.1016/j.jlamp.2021.100677
https://doi.org/10.1016/j.jlamp.2021.100677
Autor:
Tarmo Uustalu, Hendrik Maarand
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319779348
NFM
NFM
Mazurkiewicz traces are a well-known model of concurrency with a notion of equivalence for interleaving executions. Interleaving executions of a concurrent system are represented as strings over an alphabet equipped with an independence relation, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84e7ff68cba92f7bbe409a2a9231f0ce
https://doi.org/10.1007/978-3-319-77935-5_21
https://doi.org/10.1007/978-3-319-77935-5_21
Autor:
Maarand, Hendrik, Uustalu, Tarmo
Publikováno v:
Innovations in Systems & Software Engineering; Sep2019, Vol. 15 Issue 3/4, p253-265, 13p
This book constitutes the proceedings of the 20th International Colloquium on Theoretical Aspects of Computing, ICTAC 2023, which took place in Lima, Peru, during December 4–8, 2023. The 20 full papers presented in this volume together with 3 invit
Autor:
Yo-Sub Han, György Vaszil
This book constitutes the proceedings of the 24th International Conference on Descriptional Complexity of Format Systems, DCFS 2022, which was supposed to take place in Debrecen, Hungary in August 2022.The 14 full papers presented in this volume were
This book constitutes the refereed proceedings of the 23rd Symposium on Formal Methods, FM 2019, held in Porto, Portugal, in the form of the Third World Congress on Formal Methods, in October 2019. The 44 full papers presented together with 3 invited