Communicating sequential processes
Communicating sequential processes
Handbook of logic in computer science (vol. 4)
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
A Calculus of Communicating Systems
A Calculus of Communicating Systems
CCS, Location and Asynchronous Transition Systems
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
A set-theoretic framework for component composition
Fundamenta Informaticae
Modelling concurrent interactions
Theoretical Computer Science - Algebraic methodology and software technology
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)
Coordinating Object Oriented Components Using Data-Flow Networks
Formal Methods for Components and Objects
A True-Concurrent Interpretation of Behavioural Scenarios
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Component Verification in the Generic Component Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement of Interface Automata Strengthened by Action Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
A coordination model for interactive components
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
In this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent automata. Concurrent automata constitute a special kind of asynchronous transition system (ATS) used for modelling the behaviour of components as understood in component-based software development. Here, a component-based system consists of several interacting components whereby each component manages calls to and from the component using ports to ensure encapsulation. Further, a component can be complex and made of several simpler interacting components. When a complex component receives a request through one of its ports, the port delegates the request to an internal component. Our logic allows us to describe the different views we can have on the system. For example, the overall component interactions, whether they occur sequentially, simultaneously or in parallel, and how each component internally manages the received requests (possibly expressed at different levels of detail). Using concurrent automata as an underlying formalism we guarantee that the expressiveness of the logic is preserved in the model. In future work, we plan to integrate our truly-concurrent approach into the Edinburgh Concurrency Workbench.