CPO models for compact GSOS languages

DOI10.1006/INCO.1996.0077MaRDI QIDQ2506486zbMATH OpenOpenAlexFDO

Authors Luca Aceto, Anna Ingolfsdottir

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)

Recommendations

• CPO models for a class of GSOS languages
• Rational operational models
• Fully abstract denotational models for nonuniform concurrent languages
• scientific article; zbMATH DE number 92601
• A fully abstract denotational model for observational precongruence

Cited in

(14)

• Presheaf models for CCS-like languages
• 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
• Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
• SOS rule formats for idempotent terms and idempotent unary operators
• Bialgebraic semantics and recursion (extended abstract)
• CPO models for a class of GSOS languages
• SOS formats and meta-theory: 20 years after
• Lifting non-finite axiomatizability results to extensions of process algebras
• The equational theory of prebisimilarity over basic CCS with divergence

This page was built for publication: CPO models for compact GSOS languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2506486)