scientific article; zbMATH DE number 795666
From MaRDI portal
Publication:4845486
zbMATH Open0841.68042MaRDI QIDQ4845486FDOQ4845486
Authors: Tony Hoare 
Publication date: 12 September 1995
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Abstract data types; algebraic specification (68Q65)
Cited In (54)
- A fully abstract denotational semantics for the calculus of higher-order communicating systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Theory of Communicating Sequential Processes
- Fully abstract semantics for higher order communicating systems
- Asynchronous Logic Circuits and Sheaf Obstructions
- Modular specification of process algebras
- Concurrency and atomicity
- Static slicing of explicitly synchronized languages
- Transforming sequential systems into concurrent systems
- Title not available (Why is that?)
- A LISP implementation of the model for ‘communicating sequential processes’
- Title not available (Why is that?)
- Calculi for synchrony and asynchrony
- On interprocess communication. I: Basic formalism
- A general approach to queuing in C.S.P
- Title not available (Why is that?)
- Retracing some paths in process algebra
- Langages infinitaires et produit de mixage
- Algebra of communicating processes with abstraction
- On powerdomains and modality
- Communicating Sequential Processes for Centralized and Distributed Operating System Design
- Nested semantics over finite trees are equationally hard
- Title not available (Why is that?)
- A timed model for communicating sequential processes
- Title not available (Why is that?)
- Communicating parallel processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reachability is decidable for weakly extended process rewrite systems
- Title not available (Why is that?)
- Nonaxiomatisability of equivalences over finite state processes
- Algèbre de processus et synchronisation
- The reactive simulatability (RSIM) framework for asynchronous systems
- A brief history of process algebra
- Absolute versus relative time in process algebras.
- To every manifest domain a CSP expression -- a rôle for mereology in computer science
- Performance evaluation in stochastic process algebra dtsdPBC
- Models of nondeterministic regular expressions
- Title not available (Why is that?)
- Transaction processing primitives and CSP
- On the suitability of trace semantics for modular proofs of communicating processes
- Hardness of preorder checking for basic formalisms
- Nonexpressibility of fairness and signaling
- Nets, sequential components and concurrency relations
- Hybrid action systems
- Understanding concurrent systems
- Concurrent and maximally concurrent evolution of nonsequential systems
- A temporal logic approach to discrete event control for the safety canonical class
- From algebra to operational semantics
- Modelling concurrency with comtraces and generalized comtraces
- Viewing CSP specifications with UML-RT diagrams
- On describing the behavior and implementation of distributed systems
- The Fork95 programming language: Design, implementation, application.
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 Q4845486)
