A fully abstract denotational model for observational precongruence (Q5940916): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A domain equation for bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination, deadlock, and divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A term model for synchronous processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceptance trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatising Finite Concurrent Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculi for synchrony and asynchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal logics for communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation and divergence / rank
 
Normal rank

Latest revision as of 19:17, 3 June 2024

scientific article; zbMATH DE number 1635067
Language Label Description Also known as
English
A fully abstract denotational model for observational precongruence
scientific article; zbMATH DE number 1635067

    Statements

    A fully abstract denotational model for observational precongruence (English)
    0 references
    20 August 2001
    0 references
    A domain theoretic denotational model is given for a simple sublanguage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence.
    0 references
    0 references
    bisimulation
    0 references
    denotational model
    0 references
    full abstraction
    0 references