Specification-oriented semantics for communicating processes
Acta Informatica
An overview of Manifold and its implementation
Concurrency: Practice and Experience
A calculus of mobile processes, I
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Confluence in concurrent constraint programming
Theoretical Computer Science - Special issue on algebraic methodology and software technology
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
A coordination language for mobile components
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
A Discipline of Programming
Equations for Describing Dynamic Nets of Communicating Systems
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
A Model for Mobile Point-to-Point Data-flow Networks without Channel Sharing
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A foundation for actor computation
Journal of Functional Programming
A fully abstract trace model for dataflow and asynchronous networks
Distributed Computing
A Logical Interface Description Language for Components
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Coordination through Channel Composition
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
An Associative Broadcast Based Coordination Model for Distributed Processes
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
A fully abstract semantics for UML components
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
| Hi-index | 0.00 |
We introduce a state-based language for programming dynamically changing networks which consist of processes that communicate asynchronously. For this language we introduce an operational semantics and a notion of observable which includes both partial correctness and absence of deadlock. Our main result is a compositional characterization of this notion of observable for a confluent sub-language.