Titlebook: SOFSEM 2017: Theory and Practice of Computer Science; 43rd International C Bernhard Steffen,Christel Baier,Tiziana Margaria Conference proc

藐视

Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphshms for two robots as follows. (1) . We provide a polynomial time rendezvous algorithm based on ., assuming that . is known to the robots. (2) . In this case we prove the existence of more efficient rendezvous algorithms by considering the special case of the two-dimensional torus.

Emmenagogue

periodontitis

Selfish Transportation Games We identify the cases admitting a pure strategy equilibrium and consider the construction of an equilibrium, via a dedicated algorithm, or a dynamics. We also determine the price of anarchy and the price of stability for two natural social functions.

垫子

Verifying Parametric Thread Creationdesigned to operate with an arbitrary number of processes. German and Sistla, already in 1992, initiated in depth investigation of this problem for finite state systems. For infinite state systems, like pushdown systems, extra care is needed to avoid undecidability, as reachability is undecidable ev

反叛者

Network Constructors: A Model for Programmable Matter, begin from the same initial state, execute the same protocol, and can only interact in pairs. The interactions are scheduled by a . (or uniform random) scheduler, in the spirit of .. When two devices interact, the protocol takes as input their states and the state of the connection between them (.

搏斗

表主动

A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theorieson theories focuses on bisimilarity, but there is a clear interest in specification theories for other preorders and equivalences. We show that specification theories for preorders cannot exist and develop a general scheme which allows us to define behavioral specification theories, based on disjunc

山羊

frenzy

Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphsially located on two different vertices of the graph and can traverse its edges with different but constant speeds. The robots do not know their own speed. During their movement they are allowed to meet on either vertices or edges of the graph. Depending on certain conditions reflecting the knowledg

scrutiny