A proof-theoretic characterization of observational equivalence (Q1060006): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3321470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3662610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous and asynchronous experiments on processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully abstract denotational model for higher-order processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221398 / 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

Latest revision as of 17:05, 14 June 2024

scientific article
Language Label Description Also known as
English
A proof-theoretic characterization of observational equivalence
scientific article

    Statements

    A proof-theoretic characterization of observational equivalence (English)
    0 references
    0 references
    1985
    0 references
    Hennessy and Milner have shown that observational equivalence can be characterized by a modal language. We show here that a subset of this language, without an explicit negation operator, also characterizes it. Using this subset we offer sound and complete modal proof systems for simple nondeterministic languages of processes. In the case where observational equivalence is not a congruence we show that the observational congruence can also be characterized modally. Using this new language we again offer a sound and complete proof system. We briefly comment upon proof systems for extensions of the nondeterministic process languages.
    0 references
    observational equivalence
    0 references
    modal language
    0 references
    modal proof systems
    0 references
    nondeterministic languages of processes
    0 references

    Identifiers