We study first-order logic over unordered structures whose elements carr...
We propose a relaxation to the definition of a well-structured transitio...
Angluin's L* algorithm learns the minimal (complete) deterministic finit...
We study first-order logic over unordered structures whose elements carr...
The undecidability of basic decision problems for general FIFO machines ...
We correct our proof of a theorem stating that satisfiability of frequen...
This paper presents a property-directed approach to verifying recurrent
...
The problem of distributed synthesis is to automatically generate a
dist...
We study the synthesis problem for systems with a parameterized number o...
These lecture notes cover basic automata-theoretic concepts and logical
...
We propose a formal model of distributed computing based on register aut...
Message sequence charts (MSCs) naturally arise as executions of communic...
We study the gossip problem in a message-passing environment: When a pro...
Communicating finite-state machines are a fundamental, well-studied mode...