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
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Regular types for active objects
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Three logics for branching bisimulation
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Modal and temporal logics for processes
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Protocol specifications and component adaptors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking safety properties using compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
An Efficient State Space Generation for the Analysis of Real-Time Systems
IEEE Transactions on Software Engineering
Static checking of system behaviors using derived component assumptions
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
Bisimulation Minimization and Symbolic Model Checking
Formal Methods in System Design
Behavior Protocols for Software Components
IEEE Transactions on Software Engineering
Synchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work
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
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Distributed state space minimization
International Journal on Software Tools for Technology Transfer (STTT) - Special section on formal methods for industrial critical systems
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)
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
Factorization for component-interaction automata
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Partition refinement of Component Interaction Automata
Science of Computer Programming
| Hi-index | 0.00 |
Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software systems. Unfortunately, the underlying formalisms suffer from combinatorial state explosionwhen constructing new specifications for composite components or systems and may therefore render the application of these techniques impractical for real-world applications. In this paper, we explore the bisimulationtechnique as a means for a mechanical state space reduction of component-based systems. In particular, we apply both strong and weak bisimulation to Component Interaction Automatain order to obtain a minimal automatathat can serve as a behavioral equivalent abstraction for a given component specification and illustrate that the proposed approach can significantly reduce the complexity of an interface specification after composition.