A compositional model for confluent dynamic data-flow networks
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.
|Concurrent Programming (acm D.1.3), Object-oriented Programming (acm D.1.5), Language Constructs and Features (acm D.3.3), Models of Computation (acm F.1.1), Semantics of Programming Languages (acm F.3.2)|
|Programming languages (msc 68N15), None of the above, but in MSC2010 section 68Nxx (msc 68N99), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (msc 68Q10), Semantics (msc 68Q55), Specification and verification (program logics, model checking, etc.) (msc 68Q60)|
|Software Engineering [SEN]|
de Boer, F.S, & Bonsangue, M.M. (2000). A compositional model for confluent dynamic data-flow networks. Software Engineering [SEN]. CWI.