Theoretical Computer Science
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Introduction: Service-oriented computing
Communications of the ACM - Service-oriented computing
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Models and Temporal Logics for Timed Component Connectors
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Composing Web Services: A QoS View
IEEE Internet Computing
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
A Calculus and logic of resources and processes
Formal Aspects of Computing
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Extending EFSMs to specify and test timed systems with action durations and timeouts
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Automatic translation of WS-CDL choreographies to timed automata
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Conformance testing relations for timed systems
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Stochastic reasoning about channel-based component connectors
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Channel-based coordination via constraint satisfaction
Science of Computer Programming
Formal modeling
Hi-index | 0.00 |
In this paper we introduce a formal model for reasoning about resource sensitive timed component connectors. We extended the constraint automata model, which is used as the semantic model for the exogenous channelbased coordination language Reo, through integrating both resource and time information. This model allows to specify both the interactions that take time to be performed and timeouts. Moreover, the model reflects resource issues, such as bandwidth or allocated memory, that may affect the time needed for interactions when specifying the timed behavior of connectors. The time duration that an interaction takes is represented by a function on the available resources. In addition to the formalism, we also discuss compositional reasoning and present two notions of simulation to relate different connectors from functional and resourcesensitive temporal perspectives respectively.