Specification-oriented semantics for communicating processes
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.
- A calculus of communicating systems
- A calculus of total correctness for communicating processes
- A linear-history semantics for languages for distributed programming
- A more complete model of communicating processes
- A Proof System for Communicating Sequential Processes
- A proof technique for communicating sequential processes
- A Theory of Communicating Sequential Processes
- Acceptance trees
- Algebra of communicating processes with abstraction
- Algebraic laws for nondeterminism and concurrency
- Algebraic semantics
- Calculi for synchrony and asynchrony
- Communicating sequential processes
- Formal Justification of a Proof System for Communicating Sequential Processes
- Formal verification of parallel programs
- scientific article; zbMATH DE number 3817027 (Why is no real title available?)
- scientific article; zbMATH DE number 3819070 (Why is no real title available?)
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- scientific article; zbMATH DE number 3903937 (Why is no real title available?)
- scientific article; zbMATH DE number 3903940 (Why is no real title available?)
- scientific article; zbMATH DE number 3926215 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- Initial Algebra Semantics and Continuous Algebras
- Linear time and branching time semantics for recursion with merge
- Power domains
- Predicative programming Part I
- Processes and the denotational semantics of concurrency
- Proving Liveness Properties of Concurrent Programs
- Readies and Failures in the Algebra of Communicating Processes
- Semantics of nondeterminism, concurrency, and communication
- Testing equivalences for processes
- Processes with local and global liveness requirements
- Revivals, stuckness and the hierarchy of CSP models
- (Bi)simulations up-to characterise process semantics
- Abstract interface behavior of object-oriented languages with monitors
- Infinite streams and finite observations in the semantics of uniform concurrency
- Applications of compactness in the Smyth powerdomain of streams
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- A state-based approach to communicating processes
- Interpretations of recursion under unbounded nondeterminacy
- Synthesis of communicating process skeletons from temporal-spatial logic specifications
- Hiding in stream semantics of uniform concurrency
- Towards a foundation for semantics in complete metric spaces
- Correctness of concurrent processes
- Adequacy-preserving transformations of COSY path programs
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\)
- Structured operational semantics and bisimulation as a congruence
- From algebra to operational semantics
- Basic observables for processes
- On deciding trace equivalences for processes
- The connection between an event structure semantics and an operational semantics for TCSP
- A fully abstract trace model for dataflow and asynchronous networks
- On the operational semantics of nondeterminism and divergence
- Notes on the methodology of CCS and CSP
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- A hierarchy of failures-based models: theory and application
- Modular specification of process algebras
- Compositional failure-based semantic models for basic LOTOS
- A linear-time branching-time perspective on interface automata
- An application of temporal projection to interleaving concurrency
- Integrating a formal method into a software engineering process with UML and Java
- Dynamic and formal verification of embedded systems: A comparative survey
- Responsiveness and stable revivals
- Reactive bisimulation semantics for a process algebra with timeouts
- Remarks on testing probabilistic processes
- Observed Communication Semantics for Classical Processes
- Ernst-Rüdiger Olderog: A Life for Meaning
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Mediator Synthesis in a Component Algebra with Data
- Branching vs. Linear Time: Semantical Perspective
- Conflict-preserving abstraction of discrete event systems using annotated automata
- Two-thirds simulation indexes and modal logic characterization
- On Synchronous and Asynchronous Interaction in Distributed Systems
- scientific article; zbMATH DE number 3902015 (Why is no real title available?)
- scientific article; zbMATH DE number 3926215 (Why is no real title available?)
- Semantics of communicating processes
- scientific article; zbMATH DE number 3980467 (Why is no real title available?)
- scientific article; zbMATH DE number 4055005 (Why is no real title available?)
- Processes with infinite liveness requirements
- Quantales, observational logic and process semantics
- On deciding some equivalences for concurrent processes
- Composing specifications using communication
- Specification and refinement using a heterogeneous notation for concurrency and communication
- Order algebras: a quantitative model of interaction
- Behavioural equivalence for infinite systems -- partially decidable!
- Failure trace semantics for a process algebra with time-outs
- scientific article; zbMATH DE number 7559462 (Why is no real title available?)
- Towards a complete hierarchy of compositional dataflow models
- An algebraic approach to temporal logic
- Asynchronous communication of Petri nets and the refinement of transitions
- Separation Logic Semantics for Communicating Processes
- scientific article; zbMATH DE number 5263402 (Why is no real title available?)
- On cool congruence formats for weak bisimulations
- Modal logics for communicating systems
- Step failures semantics and a complete proof system
- A hierarchy of domains for real-time distributed computing
- Factorizing proofs in timed CSP
- On the specification of elementary reactive behaviour
- Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
- Divergence in testing and readiness semantics
- Axiomatizing flat iteration
- Just testing
- Synchronous development of asynchronous systems
- Covering step graph preserving failure semantics
- Branching bisimilarity for processes with time-outs
- Expansion laws for forward-reverse, forward, and reverse bisimilarities via proved encodings
- A note on the notation of recursion in process algebras
- The fixed point theory of unbounded non-determinism
- A weakest precondition semantics for communicating processes
- A partial ordering semantics for CCS
- Comparative metric semantics for concurrent PROLOG
- Step semantics for ``true concurrency with recursion
- Ready simulation for concurrency: it's logical!
This page was built for publication: Specification-oriented semantics for communicating processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060838)