Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Giusto, Cinzia"'
Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate through phases in which messages are first sent and then received, for ea
Externí odkaz:
http://arxiv.org/abs/2308.10578
Publikováno v:
EPTCS 383, 2023
This volume contains the proceedings of ICE'23, the 16th Interaction and Concurrency Experience, which was held at the NOVA University in Lisbon, Portugal, as a satellite event of DisCoTec'22. The ICE workshop series features a distinguishing review
Externí odkaz:
http://arxiv.org/abs/2308.08920
We study the complexity relationship between three models of unbounded memory automata: nu-automata ($\nu$-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory
Externí odkaz:
http://arxiv.org/abs/2307.03561
There is a wide variety of message-passing communication models, ranging from synchronous ''rendez-vous'' communications to fully asynchronous/out-of-order communications. For large-scale distributed systems, the communication model is determined by
Externí odkaz:
http://arxiv.org/abs/2210.13062
Publikováno v:
EPTCS 365, 2022
This volume contains the proceedings of ICE'22, the 15th Interaction and Concurrency Experience, which was held as an hybrid event in Lucca, Italy, and as a satellite event of DisCoTec'22. The ICE workshop series features a distinguishing review and
Externí odkaz:
http://arxiv.org/abs/2208.04086
Publikováno v:
EPTCS 347, 2021, pp. 22-37
FIFO automata are finite state machines communicating through FIFO queues. They can be used for instance to model distributed protocols. Due to the unboundedness of the FIFO queues, several verification problems are undecidable for these systems. In
Externí odkaz:
http://arxiv.org/abs/2110.00145
A communicating system is $k$-synchronizable if all of the message sequence charts representing the executions can be divided into slices of $k$ sends followed by $k$ receptions. It was previously shown that, for a fixed given $k$, one could decide w
Externí odkaz:
http://arxiv.org/abs/2104.14408
In this paper, we work on the notion of k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided into a succession of k-bounded interaction phases. We show two results (
Externí odkaz:
http://arxiv.org/abs/1909.01627
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming February 2023 131
In this paper we present a novel approach to automatically infer parameters of spiking neural networks. Neurons are modelled as timed automata waiting for inputs on a number of different channels (synapses), for a given amount of time (the accumulati
Externí odkaz:
http://arxiv.org/abs/1808.01893