CPO models for compact GSOS languages

DOI10.1006/inco.1996.0077zbMath1096.68623OpenAlexW1997305605MaRDI 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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items

Axiomatizing GSOS with termination, A format for semantic equivalence comparison, SOS formats and meta-theory: 20 years after, CPO models for a class of GSOS languages, A fully abstract model for the \(\pi\)-calculus., SOS rule formats for idempotent terms and idempotent unary operators, Bialgebraic Semantics and Recursion, Lifting non-finite axiomatizability results to extensions of process algebras, The equational theory of prebisimilarity over basic CCS with divergence, 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, Denotational fixed-point semantics for constructive scheduling of synchronous concurrency