63 search results - page 6 / 13 » Complementation of Coalgebra Automata |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
IANDC
2011
14 years 4 months ago
2011
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
CONCUR
2004
Springer
15 years 2 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...
110
click to vote
ACMMPC
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. These notes deal with an interconnecting web of mathematical techniques all of which deserve a place in the armoury of the welleducated computer scientist. The objective ...
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...