19 search results - page 1 / 4 » Message-Passing Automata Are Expressively Equivalent to EMSO... |
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
TCS
2002
13 years 5 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
FSTTCS
2006
Springer
13 years 9 months ago
2006
Springer
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
LPAR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...