Specification-oriented semantics for communicating processes (Q1060838): 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 Proof System for Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Justification of a Proof System for Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time and branching time semantics for recursion with merge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes and the denotational semantics of concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Readies and Failures in the Algebra of Communicating Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of nondeterminism, concurrency, and communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-history semantics for languages for distributed programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Algebra Semantics and Continuous Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicative programming Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more complete model of communicating processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceptance trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of total correctness for communicating processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof technique for communicating sequential processes / 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: Q3666248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing equivalences for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Liveness Properties of Concurrent Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681905 / rank
 
Normal rank

Latest revision as of 17:22, 14 June 2024

scientific article
Language Label Description Also known as
English
Specification-oriented semantics for communicating processes
scientific article

    Statements

    Specification-oriented semantics for communicating processes (English)
    0 references
    1986
    0 references
    A process P satisfies a specification S, abbreviated P sat S, if every observation we can make about the behaviour of P is allowed by S. We use this idea of process correctness as a starting point for developing a specific form of denotational semantics for processes, called here specification-oriented semantics. This approach serves as a uniform framework for generating and relating a series of increasingly sophisticated denotational models for Communicating Processes. These models differ in the underlying structure of their observations which influences both the number of representable language operators and the notion of correctness expressed by P sat S. Safety properties are treated by all models; the more sophisticated models also permit proofs of liveness properties. An important feature of the models is a special hiding operator which abstracts from internal process activity. This allows large processes to be composed hierarchically from networks of smaller ones in such a way that proofs of the whole are constructed from proofs of its components. We also show consistency of the denotational models w.r.t. a simple operational semantics based on transitions which make internal process activity explicit.
    0 references
    specification
    0 references
    denotational semantics
    0 references
    specification-oriented semantics
    0 references
    communicating processes
    0 references
    correctness
    0 references
    liveness properties
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers