scientific article
From MaRDI portal
Publication:3680258
zbMath0565.68023MaRDI QIDQ3680258
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (49)
Modelling and analysing neural networks using a hybrid process algebra ⋮ A hierarchy of domains for real-time distributed computing ⋮ Process Algebra and Model Checking ⋮ On the operational semantics of nondeterminism and divergence ⋮ Deadlock analysis in networks of communicating processes ⋮ The laws of Occam programming ⋮ Trace, failure and testing equivalences for communicating processes ⋮ Compositional failure-based semantic models for basic LOTOS ⋮ Two implementation relations and the correctness of communicating replicated processes ⋮ A timed model for communicating sequential processes ⋮ Deciding true concurrency equivalences on safe, finite nets ⋮ Fair testing ⋮ Unnamed Item ⋮ Quiescence, fairness, testing, and the notion of implementation ⋮ Unnamed Item ⋮ A functorial semantics for observed concurrency ⋮ Specifying termination in CSP ⋮ On the limits of refinement-testing for model-checking CSP ⋮ Correct and efficient antichain algorithms for refinement checking ⋮ Process simulation and refinement ⋮ A model of reconfiguration in communicating sequential processes ⋮ Deciding true concurrency equivalences on finite safe nets (preliminary report) ⋮ Compositionality in state space verification methods ⋮ Minimizing the number of transitions with respect to observation equivalence ⋮ The weakest deadlock-preserving congruence ⋮ A brief history of Timed CSP ⋮ Fixed points without completeness ⋮ Turing Machines, Transition Systems, and Interaction ⋮ Refinement-Preserving Plug-In Components ⋮ From algebra to operational semantics ⋮ A Resource Analysis of the π-calculus ⋮ Turing machines, transition systems, and interaction ⋮ The pursuit of deadlock freedom ⋮ Step failures semantics and a complete proof system ⋮ Refinement and state machine abstraction ⋮ Modular specification of process algebras ⋮ Revivals, stuckness and the hierarchy of CSP models ⋮ Unnamed Item ⋮ Relational concurrent refinement. II: Internal operations and outputs ⋮ Receptive process theory ⋮ The timed failures -- Stability model for CSP ⋮ Delay-insensitivity and ternary simulation ⋮ A Logical Process Calculus ⋮ Topology, domain theory and theoretical computer science ⋮ Specification-oriented semantics for communicating processes ⋮ Retracing CSP ⋮ Confluence Thanks to Extensional Determinism ⋮ The connection between an event structure semantics and an operational semantics for TCSP ⋮ Infinitary parallelism without unbounded nondeterminism in CSP
This page was built for publication:
