CPO models for compact GSOS languages
From MaRDI portal
Publication:2506486
DOI10.1006/inco.1996.0077zbMath1096.68623MaRDI QIDQ2506486
Luca Aceto, Anna Ingólfsdóttir
Publication date: 10 October 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0077
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q55: Semantics in the theory of computing
Related Items
SOS formats and meta-theory: 20 years after, A fully abstract model for the \(\pi\)-calculus., Finite axiom systems for testing preorder and De Simone process languages, Tile formats for located and mobile systems., Ordered SOS process languages for branching and eager bisimulations, Axiomatizing GSOS with termination, A format for semantic equivalence comparison