Fully abstract models and refinements as tools to compare agents in timed coordination languages
From MaRDI portal
(Redirected from Publication:1004066)
Recommendations
Cites work
- A calculus of communicating systems
- A refinement calculus for tuple spaces
- Coordination Models and Languages
- Coordination models and languages. 9th international conference, COORDINATION 2007, Paphos, Cyprus, June 6--8, 2007. Proceedings
- Fully abstract denotational models for nonuniform concurrent languages
- Fully abstract semantics for a coordination model with asynchronous communication and enhanced matching
- scientific article; zbMATH DE number 1615979 (Why is no real title available?)
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1049043 (Why is no real title available?)
- On the expressiveness of timed coordination models
- On the regularization of Zeno hybrid automata
- Statecharts: a visual formalism for complex systems
- The B-Book
- The Esterel synchronous programming language: Design, semantics, implementation
Cited in
(3)
This page was built for publication: Fully abstract models and refinements as tools to compare agents in timed coordination languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004066)