scientific article; zbMATH DE number 3902016
From MaRDI portal
Publication:3680258
zbMATH Open0565.68023MaRDI QIDQ3680258FDOQ3680258
Authors: Stephen Brookes, A. W. Roscoe 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4011913
- Model of error propagation in systems of communicating processes
- scientific article; zbMATH DE number 3846851
- A singleton failures semantics for communicating sequential processes
- Readies and Failures in the Algebra of Communicating Processes
- Trace, failure and testing equivalences for communicating processes
- scientific article; zbMATH DE number 988156
- Deterministic Models of Communication Faults
- Enforcing availability in failure-aware communicating systems
Cited In (51)
- Correct and efficient antichain algorithms for refinement checking
- Process algebra and model checking
- The laws of Occam programming
- Modelling and analysing neural networks using a hybrid process algebra
- A functorial semantics for observed concurrency
- Title not available (Why is that?)
- Turing machines, transition systems, and interaction
- Specifying termination in CSP
- Receptive process theory
- Divergence and unique solution of equations
- A hierarchy of domains for real-time distributed computing
- Modular specification of process algebras
- A brief history of Timed CSP
- Turing machines, transition systems, and interaction
- Refinement-preserving plug-in components
- Retracing CSP
- Refinement and state machine abstraction
- Quiescence, fairness, testing, and the notion of implementation
- A two-phase method for controlling Erlang-failure processes with high reliability
- The timed failures -- Stability model for CSP
- Step failures semantics and a complete proof system
- Revivals, stuckness and the hierarchy of CSP models
- The pursuit of deadlock freedom
- Compositionality in state space verification methods
- On the operational semantics of nondeterminism and divergence
- A timed model for communicating sequential processes
- Process simulation and refinement
- Relational concurrent refinement. II: Internal operations and outputs
- The connection between an event structure semantics and an operational semantics for TCSP
- Infinitary parallelism without unbounded nondeterminism in CSP
- Topology, domain theory and theoretical computer science
- A model of reconfiguration in communicating sequential processes
- Trace, failure and testing equivalences for communicating processes
- Deciding true concurrency equivalences on finite safe nets (preliminary report)
- Divergence and unique solution of equations
- Fair testing
- Deadlock analysis in networks of communicating processes
- A logical process calculus
- The weakest deadlock-preserving congruence
- Specification-oriented semantics for communicating processes
- Title not available (Why is that?)
- Minimizing the number of transitions with respect to observation equivalence
- A resource analysis of the \(\pi\)-calculus
- Two implementation relations and the correctness of communicating replicated processes
- Confluence thanks to extensional determinism
- Delay-insensitivity and ternary simulation
- Compositional failure-based semantic models for basic LOTOS
- On the limits of refinement-testing for model-checking CSP
- From algebra to operational semantics
- Deciding true concurrency equivalences on safe, finite nets
- Fixed points without completeness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680258)
