Communicating sequential processes
Communicating sequential processes
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Handbook of logic in computer science (vol. 4)
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
Algebraic specification of reactive systems
Theoretical Computer Science
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
Communication and Concurrency
Specification and Analysis of Concurrent Systems: The COSY Approach
Specification and Analysis of Concurrent Systems: The COSY Approach
Building product populations with software components
Proceedings of the 24th International Conference on Software Engineering
Computer
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Categories of asynchronous systems
Categories of asynchronous systems
Fairness for non-interleaving concurrency
Fairness for non-interleaving concurrency
A set-theoretic framework for component composition
Fundamenta Informaticae
Managing Complexity in Software Development with Formally Based Tools
Electronic Notes in Theoretical Computer Science (ENTCS)
Generating Snapshots of a Component Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Transaction Scripts: Making Implicit Scenarios Explicit
Electronic Notes in Theoretical Computer Science (ENTCS)
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Bounded analysis and decomposition for behavioural descriptions of components
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
| Hi-index | 0.00 |
The effective (re)use of components requires languages for the precise description of observable behaviour, along with methods for checking the compatibility of component interfaces in a design. This is even more challenging in the presence of concurrency. In previous work we have considered a set-based model of components and their composition, in a concurrent setting. In this paper, we present a class of automata, called @S-automata, in which true-concurrency is treated as an explicit structural property. We show how an automaton can be derived from a component and that every such automaton generates back a component. Apart from determining a usage protocol for the underlying component, this extension to our model provides useful insights on component composition.