Sciweavers

3750 search results - page 94 / 750
» Timed Automata Patterns
Sort
View
WIA
2004
Springer
14 years 4 months ago
On the Complexity of Hopcroft's State Minimization Algorithm
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
Jean Berstel, Olivier Carton
CSR
2010
Springer
14 years 3 months ago
Realizability of Dynamic MSC Languages
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
Benedikt Bollig, Loïc Hélouët
SIGSOFT
2008
ACM
13 years 10 months ago
Efficient online monitoring of web-service SLAs
If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risk...
Franco Raimondi, James Skene, Wolfgang Emmerich
WISE
2006
Springer
14 years 4 months ago
Pattern Based Property Specification and Verification for Service Composition
Service composition is becoming the dominant paradigm for developing Web service applications. It is important to ensure that a service composition complies with the requirements f...
Jian Yu, Tan Phan Manh, Jun Han, Yan Jin, Yanbo Ha...
ICPR
2004
IEEE
14 years 12 months ago
A Pattern Synthesis Technique with an Efficient Nearest Neighbor Classifier for Binary Pattern Recognition
Important factors affecting the efficiency and performance of the nearest neighbor classifier (NNC) are space, classification time requirements and for high dimensional data, due ...
M. Narasimha Murty, P. Viswanath, Shalabh Bhatnaga...