Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422733 | Electronic Notes in Theoretical Computer Science | 2010 | 15 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics