Theoretical Computer Science
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Team automata for groupware systems
GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Communicating sequential processes
Communications of the ACM - Special 25th Anniversary Issue
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Distributed Algorithms
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata, Languages, and Machines
Automata, Languages, and Machines
Semirings, Automata and Languages
Semirings, Automata and Languages
Synchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work
MoCha: A Middleware Based on Mobile Channels
COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
Improved undecidability results on weighted timed automata
Information Processing Letters
A Semiring-based Quantitative Analysis of Mobile Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A process calculus for qos-aware applications
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Stochastic reasoning about channel-based component connectors
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
ReoService: Coordination Modeling Tool
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
From Coordination to Stochastic Models of QoS
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
Fundamenta Informaticae - Application of Concurrency to System Design
Towards the introduction of QoS information in a component model
Proceedings of the 2010 ACM Symposium on Applied Computing
Simulation-based performance analysis of channel-based coordination models
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
Fundamenta Informaticae - Application of Concurrency to System Design
An integrated framework for QoS-based adaptation and exception resolution in WS-BPEL scenarios
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Q-automata are introduced to model quality aspects of component-based software. We propose Q-algebras as a general framework that allows us to combine and choose between quality values. Such values are added to the transitions of automata, which represent components or channels. These automata can be composed by a product construction yielding a more complex Q-automaton labelled with the combined costs of its components. Thus we establish compositionality of quality of service based on an algebra of quality attributes associated with processes represented by automata.