Sciweavers

391 search results - page 25 / 79
» Compositionality for Probabilistic Automata
Sort
View
ENTCS
2008
100views more  ENTCS 2008»
13 years 8 months ago
A Calculus for Team Automata
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens
ECOWS
2008
Springer
13 years 10 months ago
Automatic Timed Test Case Generation for Web Services Composition
In order to specify the composition of Web services, WSBPEL was defined as an orchestrating language by an international standards consortium. In this paper, we propose a method t...
Mounir Lallali, Fatiha Zaïdi, Ana R. Cavalli,...
ICFEM
2009
Springer
13 years 6 months ago
A Compositional Approach on Modal Specifications for Timed Systems
Abstract. On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, ...
Nathalie Bertrand, Axel Legay, Sophie Pinchinat, J...
ICIW
2007
IEEE
14 years 2 months ago
Web Service Composition Approaches: From Industrial Standards to Formal Methods
Abstract— Composition of web services is much studied to support business-to-business and enterprise application integration in e-Commerce. Current web service composition approa...
Maurice H. ter Beek, Antonio Bucchiarone, Stefania...
IJFCS
2008
130views more  IJFCS 2008»
13 years 8 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...