10 search results - page 1 / 2 » Muller message-passing automata and logics |
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...
IANDC
2008
13 years 4 months ago
2008
WIA
2007
Springer
13 years 11 months ago
2007
Springer
We introduce a weighted logic with discounting and we establish B¨uchi’s and Elgot’s theorem for weighted automata over finite words and arbitrary commutative semirings. The...
IEEESCC
2005
IEEE
13 years 10 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...