Fully abstract models and refinements as tools to compare agents in timed coordination languages
From MaRDI portal
Publication:1004066
DOI10.1016/j.tcs.2008.09.020zbMath1169.68033OpenAlexW1974644852MaRDI QIDQ1004066
Isabelle Linden, Jean-Marie Jacquet
Publication date: 2 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.020
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Uses Software
Cites Work
- Coordination models and languages. 9th international conference, COORDINATION 2007, Paphos, Cyprus, June 6--8, 2007. Proceedings
- Statecharts: a visual formalism for complex systems
- A calculus of communicating systems
- The Esterel synchronous programming language: Design, semantics, implementation
- Fully abstract denotational models for nonuniform concurrent languages
- A refinement calculus for tuple spaces
- On the regularization of Zeno hybrid automata
- On the expressiveness of timed coordination models
- The B-Book
- Coordination Models and Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fully abstract models and refinements as tools to compare agents in timed coordination languages