Closure properties of deterministic Petri nets
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Design and validation of computer protocols
Design and validation of computer protocols
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Computations, Residuals, and the POwer of Indeterminancy
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Robust Asynchronous Protocols Are Finite-State
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Deterministic Languages of Petri Nets
Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
Journal of Computer and System Sciences
Safety verification of asynchronous pushdown systems with shaped stacks
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We investigate an automata-theoretic model of distributed systems which communicate via message-passing. Each node in the system is a finite-state device. Channels are assumed to be reliable but may deliver messages out of order. Hence, each channel is modelled as a set of counters, one for each type of message. These counters may not be tested for zero. Though each node in the network is finite-state, the overall system is potentially infinite-state because the counters are unbounded. We work in an interleaved setting where the interactions of the system with the environment are described as sequences. The behaviour of a system is described in terms of the language which it accepts--that is, the set of valid interactions with the environment that are permitted by the system. Our aim is to characterise the class of message-passing systems whose behaviour is finite-state. Our main result is that the language accepted by a message-passing system is regular if and only if both the language and its complement are accepted by message-passing systems. We also exhibit an alternative characterisation of regular message-passing languages in terms of deterministic automata.