no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Allen-like theory of time for tree-like structures
|
Durhan, S. |
|
2018 |
|
P3 |
p. 375-389 |
article |
2 |
An automata-theoretic approach to the verification of distributed algorithms
|
Aiswarya, C. |
|
2018 |
|
P3 |
p. 305-327 |
article |
3 |
A self-stabilizing algorithm for edge monitoring in wireless sensor networks
|
Neggazi, Brahim |
|
2017 |
|
P3 |
p. 367-376 10 p. |
article |
4 |
Characterisation of the state spaces of marked graph Petri nets
|
Best, Eike |
|
2017 |
|
P3 |
p. 399-410 12 p. |
article |
5 |
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games
|
Comin, Carlo |
|
2018 |
|
P3 |
p. 348-374 |
article |
6 |
CNF and DNF succinct graph encodings
|
Das, Bireswar |
|
2017 |
|
P3 |
p. 436-447 12 p. |
article |
7 |
Complexity of a problem concerning reset words for Eulerian binary automata
|
Vorel, Vojtěch |
|
2017 |
|
P3 |
p. 497-509 13 p. |
article |
8 |
Compositional strategy synthesis for stochastic games with multiple objectives
|
Basset, N. |
|
2018 |
|
P3 |
p. 536-587 |
article |
9 |
Computation as social agency: What, how and who
|
van Benthem, Johan |
|
2018 |
|
P3 |
p. 519-535 |
article |
10 |
Constructing self-stabilizing oscillators in population protocols
|
Cooper, Colin |
|
2017 |
|
P3 |
p. 336-351 16 p. |
article |
11 |
Editorial Board
|
|
|
2017 |
|
P3 |
p. IFC- 1 p. |
article |
12 |
Editorial Board
|
|
|
2017 |
|
P3 |
p. i- 1 p. |
article |
13 |
Editorial Board
|
|
|
2017 |
|
P3 |
p. IFC- 1 p. |
article |
14 |
Editorial Board
|
|
|
2017 |
|
P3 |
p. i- 1 p. |
article |
15 |
Editorial Board
|
|
|
2017 |
|
P3 |
p. IFC- 1 p. |
article |
16 |
Editorial Board
|
|
|
2018 |
|
P3 |
p. ii |
article |
17 |
Editorial Board
|
|
|
2018 |
|
P3 |
p. ii |
article |
18 |
First-order μ-calculus over generic transition systems and applications to the situation calculus
|
Calvanese, Diego |
|
2018 |
|
P3 |
p. 328-347 |
article |
19 |
Functional encryption for cascade automata
|
Brownstein, Dan |
|
2017 |
|
P3 |
p. 384-407 24 p. |
article |
20 |
Gathering of oblivious robots on infinite grids with minimum traveled distance
|
Di Stefano, Gabriele |
|
2017 |
|
P3 |
p. 377-391 15 p. |
article |
21 |
Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
|
Molinari, Alberto |
|
2018 |
|
P3 |
p. 412-443 |
article |
22 |
Mutual visibility by luminous robots without collisions
|
Di Luna, G.A. |
|
2017 |
|
P3 |
p. 392-418 27 p. |
article |
23 |
22nd International Symposium on Temporal Representation and Reasoning (TIME 2015)
|
Grandi, Fabio |
|
2018 |
|
P3 |
p. 303-304 |
article |
24 |
On the computational power of networks of polarized evolutionary processors
|
Arroyo, Fernando |
|
2017 |
|
P3 |
p. 371-380 10 p. |
article |
25 |
On the list update problem with advice
|
Boyar, Joan |
|
2017 |
|
P3 |
p. 411-423 13 p. |
article |
26 |
Picture codes and deciphering delay
|
Anselmo, Marcella |
|
2017 |
|
P3 |
p. 358-370 13 p. |
article |
27 |
Practical verification of multi-agent systems against Slk specifications
|
Čermák, Petr |
|
2018 |
|
P3 |
p. 588-614 |
article |
28 |
Preface
|
Felber, Pascal |
|
2017 |
|
P3 |
p. 329- 1 p. |
article |
29 |
Preface to the SR-2015 special issue
|
Gutierrez, Julian |
|
2018 |
|
P3 |
p. 487 |
article |
30 |
Reachability, confluence, and termination analysis with state-compatible automata
|
Felgenhauer, Bertram |
|
2017 |
|
P3 |
p. 467-483 17 p. |
article |
31 |
Reaching approximate Byzantine consensus with multi-hop communication
|
Su, Lili |
|
2017 |
|
P3 |
p. 352-368 17 p. |
article |
32 |
Reasoning about graded strategy quantifiers
|
Malvone, Vadim |
|
2018 |
|
P3 |
p. 390-411 |
article |
33 |
Regular languages viewed from a graph-theoretic perspective
|
Konitzer, Marius |
|
2017 |
|
P3 |
p. 484-496 13 p. |
article |
34 |
Selected papers of the 8th International Conference on Language and Automata Theory and Applications (LATA 2014)
|
Dediu, Adrian-Horia |
|
2017 |
|
P3 |
p. 355-357 3 p. |
article |
35 |
Self-stabilizing leader election in polynomial steps
|
Altisen, Karine |
|
2017 |
|
P3 |
p. 330-366 37 p. |
article |
36 |
Simulating cardinal preferences in Boolean games: A proof technique
|
Ianovski, Egor |
|
2018 |
|
P3 |
p. 488-518 |
article |
37 |
Solutions to the multi-dimensional Prouhet–Tarry–Escott problem resulting from composition of balanced morphisms
|
Černý, Anton |
|
2017 |
|
P3 |
p. 424-435 12 p. |
article |
38 |
Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015)
|
Pelc, Andrzej |
|
2017 |
|
P3 |
p. 335- 1 p. |
article |
39 |
The complexity of data aggregation in static and dynamic wireless sensor networks
|
Bramas, Quentin |
|
2017 |
|
P3 |
p. 369-383 15 p. |
article |
40 |
Towards a universal approach for the finite departure problem in overlay networks
|
Koutsopoulos, Andreas |
|
2017 |
|
P3 |
p. 408-424 17 p. |
article |
41 |
Two double-exponential gaps for automata with a limited pushdown
|
Bednárová, Zuzana |
|
2017 |
|
P3 |
p. 381-398 18 p. |
article |
42 |
User-friendly temporal queries on historical knowledge bases
|
Zaniolo, Carlo |
|
2018 |
|
P3 |
p. 444-459 |
article |
43 |
Weighted automata and logics for infinite nested words
|
Droste, Manfred |
|
2017 |
|
P3 |
p. 448-466 19 p. |
article |