LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
A synchronization is a mechanism allowing two or more processes to perform actions at the same time. We study the expressive power of synchronizations gathering more and more proc...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
—This paper establishes a bridge between presheaf models for concurrency and the more operationally-informative world of event structures. It concentrates on a particular preshea...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
