Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Würdemann, Nick"'
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no return to othe
Externí odkaz:
http://arxiv.org/abs/2409.01079
Unfoldings are a well known partial-order semantics of P/T Petri nets that can be applied to various model checking or verification problems. For high-level Petri nets, the so-called symbolic unfolding generalizes this notion. A complete finite prefi
Externí odkaz:
http://arxiv.org/abs/2311.11443
Publikováno v:
EPTCS 370, 2022, pp. 178-193
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no return to othe
Externí odkaz:
http://arxiv.org/abs/2209.10323
Autor:
Gieseking, Manuel, Würdemann, Nick
Petri games are a multi-player game model for the synthesis of distributed systems with multiple concurrent processes based on Petri nets. The processes are the players in the game represented by the token of the net. The players are divided into two
Externí odkaz:
http://arxiv.org/abs/2112.04476
Autor:
Özkan, Okan, Würdemann, Nick
Publikováno v:
EPTCS 350, 2021, pp. 69-88
Resilience is a concept of rising interest in computer science and software engineering. For systems in which correctness w.r.t. a safety condition is unachievable, fast recovery is demanded. We investigate resilience problems of graph transformation
Externí odkaz:
http://arxiv.org/abs/2108.00889
Autor:
Gieseking, Manuel, Würdemann, Nick
Petri games are a multi-player game model for the synthesis problem in distributed systems, i.e., the automatic generation of local controllers. The model represents causal memory of the players, which are tokens on a Petri net and divided into two t
Externí odkaz:
http://arxiv.org/abs/2103.10207
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Fundamenta Informaticae; 2024, Vol. 192 Issue 3/4, p313-361, 49p
Autor:
Würdemann, Nick1 (AUTHOR) wuerdemann@informatik.uni-oldenburg.de, Chatain, Thomas2 (AUTHOR) thomas.chatain@inria.fr, Haar, Stefan2 (AUTHOR) stefan.haar@inria.fr, Panneke, Lukas1 (AUTHOR) lukas.panneke@informatik.uni-oldenburg.de
Publikováno v:
Fundamenta Informaticae. 2024, Vol. 192 Issue 3/4, p313-361. 49p.
Publikováno v:
LNCS
Petri Nets 2023-44TH International Conference on Applications and Theory of Petri Nets and Concurrency
Petri Nets 2023-44TH International Conference on Applications and Theory of Petri Nets and Concurrency, R&D Group on Reconfigurable and Embedded Systems at NOVA School of Science and Technology, Mar 2023, Caparica (Lisbonne), Portugal
Petri Nets 2023-44TH International Conference on Applications and Theory of Petri Nets and Concurrency
Petri Nets 2023-44TH International Conference on Applications and Theory of Petri Nets and Concurrency, R&D Group on Reconfigurable and Embedded Systems at NOVA School of Science and Technology, Mar 2023, Caparica (Lisbonne), Portugal
International audience; Unfoldings are a well known partial-order semantics of P/T Petri nets that can be applied to various model checking or verification problems. For high-level Petri nets, the so-called symbolic unfolding generalizes this notion.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::96b793725022cf45675e4ab0f3732a37
https://inria.hal.science/hal-04029490/file/FinCompPrefSymb-full.pdf
https://inria.hal.science/hal-04029490/file/FinCompPrefSymb-full.pdf