Compositional Failure-based Equivalence of Constraint Automata

Authors:
Mohammad Izadi;Ali Movaghar
Affiliations:
Department of computer Engineering, Sharif University of Technology, Tehran, Iran and Research Institute for Humanities and Cultural Studies (IHCS), Tehran, Iran and Leiden Institute of Advanced C ...;Department of computer Engineering, Sharif University of Technology, Tehran, Iran
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 16
Cited 0

Compositional model checking

Proceedings of the Fourth Annual Symposium on Logic in computer science
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking

Model checking
Communication and Concurrency

Communication and Concurrency
Revised Lectures from the International Symposium on Compositionality: The Significant Difference

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
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
Verification for Robust Specification

TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
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
Symmetry and Model Checking

CAV '93 Proceedings of the 5th International Conference 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)
An Equivalence Based Method for Compositional Verification of the Linear Temporal Logic of Constraint Automata

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reo is a coordination language for modeling component connectors of component-based computing systems. Constraint automaton, as an extension of finite automaton, has been proposed as the operational semantics of Reo. In this paper, we introduce an extended definition of constraint automaton by which, every constraint automaton can be considered as a labeled transition system and each labeled transition system can be translated into a constraint automaton. We show that failure-based equivalences CFFD and NDFD are congruences with respect to composition of constraint automata using their join (production) and hiding operators. Based on these congruency results and by considering the temporal logic preservation properties of CFFD and NDFD equivalences, they can be used for reducing sizes of models before doing model checking based verification.