Compositional failure-based semantic equivalences for Reo specifications

Authors:
Mohammad Izadi;Ali Movaghar
Affiliations:
sharif University of Technology, Tehran, Iran;sharif University of Technology, Tehran, Iran
Venue:
Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
Year:
2007

Citing 10
Cited 0

Communicating sequential processes

Communicating sequential processes
Compositional model checking

Proceedings of the Fourth Annual Symposium on Logic in computer science
Communication and Concurrency

Communication and Concurrency
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm

Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Coordination through Channel Composition

COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Compositional Minimization of Finite State Systems

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Reo: a channel-based coordination model for component composition

Mathematical Structures in Computer Science
Abstract behavior types: a foundation model for components and their composition

Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
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)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reo is a coordination language for modeling component connectors of component-based computing systems. We show that the failure-based equivalences NDFD and CFFD are congruences with respect to composition operators of Reo.