Sciweavers

391 search results - page 10 / 79
» Compositionality for Probabilistic Automata
Sort
View
FOSSACS
2005
Springer
14 years 2 months ago
Axiomatizations for Probabilistic Finite-State Behaviors
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...
Yuxin Deng, Catuscia Palamidessi
FOCS
1997
IEEE
14 years 24 days ago
On the Power of Quantum Finite State Automata
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
Attila Kondacs, John Watrous
ISSRE
2010
IEEE
13 years 7 months ago
Automata-Based Verification of Security Requirements of Composite Web Services
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
JWSR
2006
113views more  JWSR 2006»
13 years 8 months ago
Search Strategies for Automatic Web Service Composition
: We investigate architectural properties required for supporting automatic service composition. First, composable service architecture will be described, based on modeling Web ser...
Nikola Milanovic, Miroslaw Malek
RP
2009
Springer
124views Control Systems» more  RP 2009»
14 years 3 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez