Zobrazeno 1 - 10
of 202
pro vyhledávání: '"Muscholl, Anca"'
We revisit finite-state communicating systems with round-based communication under mailbox semantics. Mailboxes correspond to one FIFO buffer per process (instead of one buffer per pair of processes in peer-to-peer systems). Round-based communication
Externí odkaz:
http://arxiv.org/abs/2407.06968
Autor:
Filiot, Emmanuel, Jecker, Ismaël, Puppis, Gabriele, Löding, Christof, Muscholl, Anca, Winter, Sarah
A transducer is finite-valued if for some bound k, it maps any given input to at most k outputs. For classical, one-way transducers, it is known since the 80s that finite valuedness entails decidability of the equivalence problem. This decidability r
Externí odkaz:
http://arxiv.org/abs/2405.08171
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
We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theory of Mazurkiewicz traces. We investigate the question whether channel bound condi
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A32730
https://ul.qucosa.de/api/qucosa%3A32730/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A32730/attachment/ATT-0/
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
The origin semantics for transducers was proposed in 2014, and led to various characterizations and decidability results that are in contrast with the classical semantics. In this paper we add a further decidability result for characterizing transduc
Externí odkaz:
http://arxiv.org/abs/2101.08011
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 3 (July 21, 2021) lmcs:6039
We present pumping lemmas for five classes of functions definable by fragments of weighted automata over the min-plus semiring, the max-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of functions definabl
Externí odkaz:
http://arxiv.org/abs/2001.06272
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 1 (February 13, 2020) lmcs:5640
We show that the minimization of visibly pushdown automata is NP-complete. This result is obtained by introducing immersions, that recognize multiple languages (over a usual, non-visible alphabet) using a common deterministic transition graph, such t
Externí odkaz:
http://arxiv.org/abs/1907.09563
Autor:
Bose, Sougata, Krishna, Shankara Narayanan, Muscholl, Anca, Penelle, Vincent, Puppis, Gabriele
We study two formalisms that allow to compare transducers over words under origin semantics: rational and regular resynchronizers, and show that the former are captured by the latter. We then consider some instances of the following synthesis problem
Externí odkaz:
http://arxiv.org/abs/1906.08688