Zobrazeno 1 - 10
of 199
pro vyhledávání: '"Walukiewicz, Igor"'
In parametric lock-sharing systems processes can spawn new processes to run in parallel, and can create new locks. The behavior of every process is given by a pushdown automaton. We consider infinite behaviors of such systems under strong process fai
Externí odkaz:
http://arxiv.org/abs/2307.04925
We consider the distributed control synthesis problem for systems with locks. The goal is to find local controllers so that the global system does not deadlock. With no restriction this problem is undecidable even for three processes each using a fix
Externí odkaz:
http://arxiv.org/abs/2204.12409
Autor:
Muscholl, Anca, Walukiewicz, Igor
We present two active learning algorithms for sound deterministic negotiations. Sound deterministic negotiations are models of distributed systems, a kind of Petri nets or Zielonka automata with additional structure. We show that this additional stru
Externí odkaz:
http://arxiv.org/abs/2110.02783
Finitary Idealized Concurrent Algol (FICA) is a prototypical programming language combining functional, imperative, and concurrent computation. There exists a fully abstract game model of FICA, which in principle can be used to prove equivalence and
Externí odkaz:
http://arxiv.org/abs/2101.08720
The Heard-Of model is a simple and relatively expressive model of distributed computation. Because of this, it has gained a considerable attention of the verification community. We give a characterization of all algorithms solving consensus in a frag
Externí odkaz:
http://arxiv.org/abs/2004.09621
We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting this explo
Externí odkaz:
http://arxiv.org/abs/1907.02296
Negotiation diagrams are a model of concurrent computation akin to workflow Petri nets. Deterministic negotiation diagrams, equivalent to the much studied and used free-choice workflow Petri nets, are surprisingly amenable to verification. Soundness
Externí odkaz:
http://arxiv.org/abs/1704.04190
Publikováno v:
Logical Methods in Computer Science, Volume 14, Issue 1, Concurrency theory (January 16, 2018) lmcs:3196
Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized choice as communication primitive. Well-designed negotiations must be sound, meaning that, wha
Externí odkaz:
http://arxiv.org/abs/1703.05137
In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables that are shared with their parent. We show that reachability for dynami
Externí odkaz:
http://arxiv.org/abs/1609.05385
Autor:
Salvati, Sylvain, Walukiewicz, Igor
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 1 (March 23, 2017) lmcs:3215
We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations. Weak monadic second-order logic (wMSOL) is w
Externí odkaz:
http://arxiv.org/abs/1609.02753