Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Gieseking, Manuel"'
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
In the synthesis of distributed systems, we automate the development of distributed programs and hardware by automatically deriving correct implementations from formal specifications. For synchronous distributed systems, the synthesis problem is well
Externí odkaz:
http://arxiv.org/abs/2107.09280
Developing algorithms for distributed systems is an error-prone task. Formal models like Petri nets with transits and Petri games can prevent errors when developing such algorithms. Petri nets with transits allow us to follow the data flow between co
Externí odkaz:
http://arxiv.org/abs/2103.15521
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
To model check concurrent systems, it is convenient to distinguish between the data flow and the control. Correctness is specified on the level of data flow whereas the system is configured on the level of control. Petri nets with transits and Flow-L
Externí odkaz:
http://arxiv.org/abs/2007.07235
The correctness of networks is often described in terms of the individual data flow of components instead of their global behavior. In software-defined networks, it is far more convenient to specify the correct behavior of packets than the global beh
Externí odkaz:
http://arxiv.org/abs/2005.07130
We present a model checking approach for the verification of data flow correctness in networks during concurrent updates of the network configuration. This verification problem is of great importance for software-defined networking (SDN), where error
Externí odkaz:
http://arxiv.org/abs/1907.11061
Petri games have been introduced as a multi-player game model representing causal memory to address the synthesis of distributed systems. For Petri games with one environment player and an arbitrary bounded number of system players, deciding the exis
Externí odkaz:
http://arxiv.org/abs/1904.05621
Publikováno v:
EPTCS 260, 2017, pp. 23-43
Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic approach decides the existence of a winning strategy via a reduction
Externí odkaz:
http://arxiv.org/abs/1711.10637
Autor:
Gieseking, Manuel1 (AUTHOR), Olderog, Ernst-Rüdiger1 (AUTHOR), Würdemann, Nick1 (AUTHOR) wuerdemann@informatik.uni-oldenburg.de
Publikováno v:
Acta Informatica. Oct2020, Vol. 57 Issue 3-5, p591-626. 36p.
