CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
The availability of repositories of Web service descriptions enables interesting forms of dynamic Web service discovery, such as searching for Web services exposing a specified beh...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
We present the tool Sycraft (SYmboliC synthesizeR and Adder of Fault-Tolerance). In Sycraft, a distributed fault-intolerant program is specified in terms of a set of processes and ...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider asynchronous networks of finite-state systems communicating via a combination of reliable and lossy fifo channels. Depending on the topology, the reachability...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
We present a framework that combines ideas from spatial logics and Igarashi and Kobayashi's behavioural type systems, drawing benefits from both. In our approach, type systems...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
