Fully abstract denotational models for nonuniform concurrent languages

DOI10.1006/inco.1994.1095zbMath0824.68060OpenAlexW2156335201MaRDI QIDQ1341758

E. Horita, J. W. de Bakker, Jan J. M. M. Rutten

Publication date: 9 January 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1437

zbMATH Keywords

Plotkin-style transition system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Unnamed Item ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ Fully abstract models and refinements as tools to compare agents in timed coordination languages ⋮ Full Abstraction for Linda ⋮ Denotational models for programming languages: Applications of Banach's fixed point theorem ⋮ Strong fairness and full abstraction for communicating processes ⋮ Rendez-vous with metric semantics

This page was built for publication: Fully abstract denotational models for nonuniform concurrent languages