The following pages link to (Q3680258):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Specifying termination in CSP (Q407510) (← links)
- The pursuit of deadlock freedom (Q580970) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- The weakest deadlock-preserving congruence (Q673911) (← links)
- A brief history of Timed CSP (Q674191) (← links)
- Fixed points without completeness (Q674192) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Receptive process theory (Q758200) (← links)
- Fair testing (Q865623) (← links)
- Process simulation and refinement (Q911322) (← links)
- A model of reconfiguration in communicating sequential processes (Q918723) (← links)
- Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Trace, failure and testing equivalences for communicating processes (Q1104076) (← links)
- A timed model for communicating sequential processes (Q1109561) (← links)
- Minimizing the number of transitions with respect to observation equivalence (Q1182610) (← links)
- From algebra to operational semantics (Q1209325) (← links)
- The timed failures -- Stability model for CSP (Q1274446) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- The connection between an event structure semantics and an operational semantics for TCSP (Q1323346) (← links)
- Infinitary parallelism without unbounded nondeterminism in CSP (Q1323355) (← links)
- On the operational semantics of nondeterminism and divergence (Q1350504) (← links)
- Two implementation relations and the correctness of communicating replicated processes (Q1362771) (← links)
- Deciding true concurrency equivalences on safe, finite nets (Q1365677) (← links)
- Quiescence, fairness, testing, and the notion of implementation (Q1376423) (← links)
- Delay-insensitivity and ternary simulation (Q1575731) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Compositional failure-based semantic models for basic LOTOS (Q1903079) (← links)
- On the limits of refinement-testing for model-checking CSP (Q1941896) (← links)
- Deadlock analysis in networks of communicating processes (Q2638755) (← links)
- The laws of Occam programming (Q2640348) (← links)
- A logical process calculus (Q2842601) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- (Q3761679) (← links)
- Deciding true concurrency equivalences on finite safe nets (preliminary report) (Q4630288) (← links)
- Compositionality in state space verification methods (Q4633153) (← links)
- Turing Machines, Transition Systems, and Interaction (Q4917087) (← links)
- Refinement-Preserving Plug-In Components (Q4923380) (← links)
- A functorial semantics for observed concurrency (Q5096853) (← links)
- (Q5111623) (← links)
- A two-phase method for controlling Erlang-failure processes with high reliability (Q5124798) (← links)
- Divergence and unique solution of equations (Q5228882) (← links)
- Retracing CSP (Q5262957) (← links)
- Confluence Thanks to Extensional Determinism (Q5262976) (← links)
- A Resource Analysis of the π-calculus (Q5739364) (← links)
- (Q5856411) (← links)
- A hierarchy of domains for real-time distributed computing (Q5887512) (← links)
- Refinement and state machine abstraction (Q5958757) (← links)
