Three partition refinement algorithms
SIAM Journal on Computing
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Support for Reusability in Genesis
IEEE Transactions on Software Engineering
Software architecture: perspectives on an emerging discipline
Software architecture: perspectives on an emerging discipline
Component-oriented software technology
Object-oriented software composition
Static checking of system behaviors using derived component assumptions
ACM Transactions on Software Engineering and Methodology (TOSEM)
A partition refinement algorithm for the &pgr;-calculus
Information and Computation - Special issue on FLOC '96
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Component Software: Beyond Object-Oriented Programming
Component Software: Beyond Object-Oriented Programming
Communication and Concurrency
A mathematical theory of communication
ACM SIGMOBILE Mobile Computing and Communications Review
Making Components Contract Aware
Computer
Behavior Protocols for Software Components
IEEE Transactions on Software Engineering
Synchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work
A Basic Model of Typed Components
ECOOP '00 Proceedings of the 14th European Conference on Object-Oriented Programming
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
System-Level Types for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Interface Compatibility Checking for Software Modules
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Scale-free geometry in OO programs
Communications of the ACM - Adaptive complex enterprises
Component-interaction automata as a verification-oriented component-based system specification
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
Component Substitutability via Equivalencies of Component-Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
IEEE Transactions on Software Engineering
Introduction to Automata Theory, Languages, and Computation
Introduction to Automata Theory, Languages, and Computation
State Space Reduction Techniques for Component Interfaces
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Adaptation of Service Protocols Using Process Algebra and On-the-Fly Reduction Techniques
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Patterns of component evolution
SC'07 Proceedings of the 6th international conference on Software composition
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Use of Properties in Java Applications
ASWEC '10 Proceedings of the 2010 21st Australian Software Engineering Conference
Invited contribution: sociable interfaces
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
A core theory of interfaces and architecture and its impact on object orientation
Proceedings of the 2004 international conference on Architecting Systems with Trustworthy Components
Hi-index | 0.00 |
Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of hierarchically-structured component-oriented software systems. However, the rules governing composition typically suffer from combinatorial state explosion, an effect that can impede modeling languages, like Component Interaction Automata, from being successful in real-world scenarios. We must, therefore, find some appropriate ways to counteract state explosion, one of which is partition refinement through bisimulation, in particular, weak bisimulation. While this technique can yield the desired state space reduction, it does not consider synchronization cliques, that is, groups of states that are interconnected solely by internal synchronization transitions. Synchronization cliques give rise to action prefixes, local states that encapsulate pre-conditions for a component's ability to interact with the environment. Furthermore, both the existence and the size of synchronization cliques can be used as an indicator for the success of partition refinement. In particular, the more frequent synchronization cliques are and the more states they entail, the more likely it is that partition refinement can reduce the state space. But, there may be other factors that impact the refinement process. For this reason, we study, in this paper, how partition refinement behaves under weak bisimulation, how synchronization cliques emerge when using weak bisimulation, how we make state space reduction through partition refinement aware of the existence of synchronization cliques, and what other attributes of Component Interaction Automata specifications can provides us with additional cues to forecast the possible outcome of the partition refinement process.