A Theory of Communicating Sequential Processes
From MaRDI portal
Publication:3765233
DOI10.1145/828.833zbMATH Open0628.68025DBLPjournals/jacm/BrookesHR84OpenAlexW2102097307WikidataQ56210213 ScholiaQ56210213MaRDI QIDQ3765233FDOQ3765233
Authors: Stephen Brookes, A. W. Roscoe, Tony Hoare 
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/828.833
Recommendations
Cited In (only showing first 100 items - show all)
- Process algebra with four-valued logic
- A partial ordering semantics for CCS
- Failures semantics based on interval semiwords is a congruence for refinement
- Maurer computers for pipelined instruction processing
- Specification and verification of database dynamics
- On the analysis of cooperation and antagonism in networks of communicating processes
- A fully abstract model for the exchange of information in multi-agent systems.
- A denotational semantic theory of concurrent systems
- On deciding trace equivalences for processes
- Concurrency and atomicity
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
- Type theory and concurrency
- Unguardedness mostly means many solutions
- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
- Title not available (Why is that?)
- A fully abstract may testing semantics for concurrent objects
- Preferential choice and coordination conditions
- Amalgamation of graph transformations: a synchronization mechanism
- Title not available (Why is that?)
- Duplication of constants in process algebra
- Global renaming operators in concrete process algebra
- Modal logics for communicating systems
- Refusal testing
- Step failures semantics and a complete proof system
- A linear-history semantics for languages for distributed programming
- Reachability problems for sequential dynamical systems with threshold functions.
- Distributed synthesis in continuous time
- Bochvar-McCarthy logic and process algebra
- The Value-Passing Calculus
- On the operational semantics of nondeterminism and divergence
- Vertical implementation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Denotational semantics of communicating sequential programs
- Just testing
- Partial specifications and compositional verification
- Axiomatizing GSOS with termination
- Discrete time process algebra
- Title not available (Why is that?)
- A compositional proof system on a category of labelled transition systems
- Translating FSP into LOTOS and networks of automata
- Process simulation and refinement
- Relational concurrent refinement. II: Internal operations and outputs
- Refinement, conformance and inheritance
- Integrating a formal method into a software engineering process with UML and Java
- Title not available (Why is that?)
- To know or not to know: Epistemic approaches to security protocol verification
- Specification completion for IOCO
- Specification styles in distributed systems design and verification
- Refined Interfaces for Compositional Verification
- Belnap's logic and conditional composition
- Title not available (Why is that?)
- On deciding some equivalences for concurrent processes
- Unique decomposition of processes
- Deciding true concurrency equivalences on finite safe nets (preliminary report)
- Parallelization alternatives and their performance for the convex hull problem
- Generic models of the laws of programming
- Denotational semantics of communicating processes based on a language for applicative multiprogramming
- Multiple Viewpoint Contract-Based Specification and Design
- Ready to preorder: the case of weak process semantics
- Port automata and the algebra of concurrent porcesses
- Event structure semantics for multiparty sessions
- Ensuring liveness properties of distributed systems: open problems
- Comparative semantics for flow of control in logic programming without logic
- From algebra to operational semantics
- Process algebra and constraint programming for modeling interactions in MAS
- Infinite streams and finite observations in the semantics of uniform concurrency
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Deciding true concurrency equivalences on safe, finite nets
- Unbounded nondeterminism in CSP
- A note on the notation of recursion in process algebras
- Towards general axiomatizations for bisimilarity and trace semantics
- Reflections on the future of concurrency theory in general and process calculi in particular
- Quantales, observational logic and process semantics
- Relational structures model of concurrency
- Preserving Contract Satisfiability Under Non-monotonic Composition
- Title not available (Why is that?)
- An algebraic theory of interface automata
- Concurrent histories: a basis for observing distributed systems
- The how and why of interactive Markov chains
- Trace- and failure-based semantics for responsiveness
- Journeys in non-classical computation I: A grand challenge for computing research
- Testing probabilistic automata
- Nested-unit Petri nets
- Specifying termination in CSP
- Title not available (Why is that?)
- Proved trees
- A complete axiomatisation for observational congruence of finite-state behaviours
- Conjunction on processes: Full abstraction via ready-tree semantics
- Structural operational semantics for weak bisimulations
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- The algebra of communicating processes with empty process
- Relating fair testing and accordance for service replaceability
- Ready simulation for concurrency: it's logical!
- An algebraic theory for web service contracts
- Progress assumption in concurrent systems
- On cool congruence formats for weak bisimulations
- On the nature of events: another perspective in concurrency
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- Quiescence, fairness, testing, and the notion of implementation
This page was built for publication: A Theory of Communicating Sequential Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765233)
