Atomic compactness for reflexive graphs by Christian D e l h o m m ? (La R?union) Abstract. A first order structure M with universe M is atomic compact if every system of atomic formulas with paramete...
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability # that a program for infinite computations (a program that never halts) outputs a cofinite set is ...
. An algebra of processes is proposed in which processes are modelled in terms of data rather than events. Structures representing processes are similar to the labelled event structures of Winskel (19...
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability # that a program for infinite computations (a program that never halts) outputs a cofinite set is ...
Abstract. We look at ways to enrich Alternating-time Temporal Logic (ATL) ? a logic for specification and verification of multi-agent systems ? with a notion of knowledge. Starting point of our study ...
Abstract.We give a completion theorem for ordered magmas (i.e. ordered algebras with monotone operations) in a general form. Particular instances of this theorem are already known, and new results fol...
In this paper, we study a trade-off between internal states and communication bits in firing squad synchronization problems on communication-restricted cellular automata and propose several time-optim...