Sciweavers

COORDINATION
2006
Springer
13 years 11 months ago
Automated Evaluation of Coordination Approaches
How to coordinate the processes in a complex component-based software system is a nontrivial issue. Many different coordination approaches exist, each with its own specific advanta...
Tibor Bosse, Mark Hoogendoorn, Jan Treur
COORDINATION
2006
Springer
13 years 11 months ago
Synthesizing Concurrency Control Components from Process Algebraic Specifications
Process algebraic specifications can provide useful support for the architectural design of software systems due to the possibility of analyzing their properties. In addition to th...
Edoardo Bontà, Marco Bernardo, Jeff Magee, ...
COORDINATION
2006
Springer
13 years 11 months ago
Evolution On-the-Fly with Paradigm
The coordination language Paradigm allows for a flexible and orthogonal modeling of interprocess relationships at the architectural level. It is shown how dynamic system adaptation...
Luuk Groenewegen, Erik P. de Vink
COORDINATION
2006
Springer
13 years 11 months ago
Atomic Commit and Negotiation in Service Oriented Computing
In this paper we investigate the relationship between two problems, related to distributed systems, that are of particular interest in the context of Service Oriented Computing: at...
Laura Bocchi, Roberto Lucchi
COORDINATION
2006
Springer
13 years 11 months ago
Stochastic Reasoning About Channel-Based Component Connectors
Abstract. Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a netw...
Christel Baier, Verena Wolf
COORDINATION
2006
Springer
13 years 11 months ago
A WSDL-Based Type System for WS-BPEL
We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages f...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
CONCUR
2006
Springer
13 years 11 months ago
A Capability Calculus for Concurrency and Determinism
Abstract. We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be par...
Tachio Terauchi, Alex Aiken
CONCUR
2006
Springer
13 years 11 months ago
Probabilistic I/O Automata: Theories of Two Equivalences
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
CONCUR
2006
Springer
13 years 11 months ago
Probability and Nondeterminism in Operational Models of Concurrency
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...
Roberto Segala