391 search results - page 28 / 79 » Compositionality for Probabilistic Automata |
144
click to vote
CAV
2006
Springer
15 years 7 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
112
click to vote
ETFA
2006
IEEE
15 years 9 months ago
2006
IEEE
New technological trends lead to the increasing use of network technologies in automation. Especially the Ethernet with TCP/IP and wireless networks find growing acceptance. The r...
113
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
154
Voted
CONCUR
2003
Springer
15 years 8 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
177
Voted
ICSOC
2010
Springer
15 years 1 months ago
2010
Springer
Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of ser...