Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Rational series and their languages
Rational series and their languages
On the degree of ambiguity of finite automata
Theoretical Computer Science
Finite-valued distance automata
Selected papers of the second international colloquium on Words, languages and combinatorics
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
P-Hardness of Equivalence Testing on Finite-State Processes
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Weak bisimulation for (max/+) automata and related models
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Enhancements of partitioning techniques for image compression using weighted finite automata
Theoretical Computer Science - Implementation and application automata
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A Model-driven WSDL Extension for Describing the QoS ofWeb Services
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Component Substitutability via Equivalencies of Component-Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
How to Handle QoS Aspects in Web Services Substitutivity Verification
WETICE '07 Proceedings of the 16th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
Energy-aware routing for wireless sensor networks by AHP
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Dynamic contextual service ranking
SC'07 Proceedings of the 6th international conference on Software composition
Context-based behavioral equivalence of components in self-adaptive systems
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
| Hi-index | 0.00 |
Several scientific bottlenecks have been identified in existing component-based approaches. Among them, we focus on the identification of a relevant abstraction for the component expression and verification of properties like substitutivity: When is it possible to formally accept or reject the substitution of a component in a composition? This paper suggests max/plus automata to tackle this problem when considering a new factor - Quality of Service (QoS). Four notions of simulation-based substitutivity managing QoS aspects are proposed, and related complexity issues on max/plus automata are investigated.