On the k-synchronizability of systems

09/04/2019
by   Cinzia Di Giusto, et al.
0

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 (both for mailbox and peer-to-peer automata): first, the reachability problem is decidable for k-synchronizable systems; second, the membership problem (whether a given system is k-synchronizable) is decidable as well. Our proofs fix several important issues in previous attempts to prove these two results for mailbox automata.

READ FULL TEXT
research
09/04/2019

On the k-synchronizability for mailbox systems

Asynchronous bounded or unbounded message passing is ubiquitous in commu...
research
09/28/2020

Reachability for Updatable Timed Automata made faster and more effective

Updatable timed automata (UTA) are extensions of classic timed automata ...
research
10/23/2019

Complexity Results on Register Pushdown Automata

Register pushdown automata (RPDA) is an extension of classical pushdown ...
research
02/15/2021

Model-bounded monitoring of hybrid systems

Monitoring of hybrid systems attracts both scientific and practical atte...
research
06/14/2021

Minimality Notions via Factorization Systems

For the minimization of state-based systems (i.e. the reduction of the n...
research
02/25/2019

On reachability problems for low dimensional matrix semigroups

We consider the Membership and the Half-space Reachability Problems for ...
research
10/24/2021

Refuting Tianrong Lin's arXiv:2110.05942 "Resolution of The Linear-Bounded Automata Question”

In the preprint mentioned in the title Mr. Tianrong claims to prove NSPA...

Please sign up or login with your details

Forgot password? Click here to reset