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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The smart floor: a mechanism for natural user identification and tracking
CHI '00 Extended Abstracts on Human Factors in Computing Systems
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
Automatic component protocol adaptation with the CoConut/J tool suite
Future Generation Computer Systems - Tools for program development and analysis
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
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
WWW '05 Proceedings of the 14th international conference on World Wide Web
Software—Practice & Experience
Practical Verification of Component Substitutability Using Subtype Relation
EUROMICRO '06 Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications
A Model-driven WSDL Extension for Describing the QoS ofWeb Services
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Model-Based performance prediction with the palladio component model
WOSP '07 Proceedings of the 6th international workshop on Software and performance
Concurrent Logic and Automata Combined: A Semantics for Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Component Substitutability via Equivalencies of Component-Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Interactive tool support for CSP || B consistency checking
Formal Aspects of Computing
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
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
Positioning Support in Pervasive Environments
PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services
Verification of evolving software via component substitutability analysis
Formal Methods in System Design
A Declarative Approach for QoS-Aware Web Service Compositions
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Minimum-cost delegation in service composition
Theoretical Computer Science
Deciding service composition and substitutability using extended operating guidelines
Data & Knowledge Engineering
Minimal yet effective reconfiguration infrastructures in component-based embedded systems
Proceedings of the 2009 ESEC/FSE workshop on Software integration and evolution @ runtime
Modelling Component Behaviour with Concurrent Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Operating guidelines for finite-state services
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Experience with safe dynamic reconfigurations in component-based embedded systems
CBSE'07 Proceedings of the 10th international conference on Component-based software engineering
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
Modelling parametric contracts and the state space of composite components by graph grammars
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Service substitutability analysis based on behavior automata
Innovations in Systems 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 integer weighted 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 integer weighted automata are investigated. Furthermore, the paper defines composition operators: sequential, strict-sequential and parallel compositions, bringing path costs into the analysis. New results on the compatibility of proposed substitutivity notions w.r.t. sequential and parallel composition operators are established.