A Theory of Communicating Sequential Processes
From MaRDI portal
Publication:3765233
DOI10.1145/828.833zbMath0628.68025DBLPjournals/jacm/BrookesHR84OpenAlexW2102097307WikidataQ56210213 ScholiaQ56210213MaRDI QIDQ3765233
Stephen Brookes, A. W. Roscoe, C. A. R. 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
Related Items (only showing first 100 items - show all)
Preserving Contract Satisfiability Under Non-monotonic Composition ⋮ A hierarchy of domains for real-time distributed computing ⋮ Unbounded nondeterminism in CSP ⋮ Termination, deadlock and divergence ⋮ A technique for specifying and refining TCSP processes by using guards and liveness conditions ⋮ A fully parallel calculus of synchronizing processes ⋮ Discrete time process algebra with abstraction ⋮ Quantales, observational logic and process semantics ⋮ Unnamed Item ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ Temporal structures ⋮ An algebraic framework for developing and maintaining real-time systems ⋮ Unnamed Item ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Just testing ⋮ Testing probabilistic automata ⋮ On relating concurrency and nondeterminism ⋮ On continuous time agents ⋮ Formally verified animation for RoboChart using interaction trees ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ Unnamed Item ⋮ Generating diagnostic information for behavioral preorders ⋮ Unnamed Item ⋮ Deciding true concurrency equivalences on finite safe nets (preliminary report) ⋮ On deciding some equivalences for concurrent processes ⋮ Compositionality in state space verification methods ⋮ Divergence and fair testing ⋮ Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities ⋮ Symmetric and Asymmetric Asynchronous Interaction ⋮ Anatomy of a Domain of Continuous Random Variables II ⋮ Refinement-Preserving Plug-In Components ⋮ Deadlock Detection in Linear Recursive Programs ⋮ Bochvar-McCarthy logic and process algebra ⋮ Algebraic characterizations of trace and decorated trace equivalences over tree-like structures ⋮ Real time process algebra with time-dependent conditions ⋮ Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence ⋮ Unnamed Item ⋮ Underspecification for a simple process algebra of recursive processes. ⋮ Asynchronous communication of Petri Nets and the refinement of transitions ⋮ Proved trees ⋮ Checking equivalences between concurrent systems of finite agents (Extended abstract) ⋮ Maurer computers for pipelined instruction processing ⋮ Unnamed Item ⋮ Process algebra with four-valued logic ⋮ Deciding bisimulation equivalences for a class of non-finite-state programs ⋮ Basic observables for processes ⋮ Journeys in non-classical computation I: A grand challenge for computing research ⋮ Structural non-interference in elementary and trace nets ⋮ Retracing CSP ⋮ Confluence Thanks to Extensional Determinism ⋮ On concurrent behaviors and focusing in linear logic ⋮ Axiomatizing GSOS with termination ⋮ A fully abstract trace model for dataflow and asynchronous networks ⋮ On sequential composition, action prefixes and process prefix ⋮ When is partial trace equivalence adequate? ⋮ Compositionality of Hennessy-Milner logic by structural operational semantics ⋮ Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Composing models ⋮ Property preserving abstractions for the verification of concurrent systems ⋮ Process Algebra and Model Checking ⋮ Synchronization trees ⋮ Testing equivalences for processes ⋮ Schedulers and Finishers: On Generating the Behaviours of an Event Structure ⋮ On the operational semantics of nondeterminism and divergence ⋮ On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Trace Semantics for IPDL ⋮ Asynchronous communication model based on linear logic ⋮ A compositional proof system on a category of labelled transition systems ⋮ Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency ⋮ Compositional failure-based semantic models for basic LOTOS ⋮ Two implementation relations and the correctness of communicating replicated processes ⋮ Deciding true concurrency equivalences on safe, finite nets ⋮ Discrete time process algebra ⋮ Quiescence, fairness, testing, and the notion of implementation ⋮ Complexity of equivalence problems for concurrent systems of finite agents ⋮ A Denotational Semantic Theory of Concurrent Systems ⋮ Coupled similarity: the first 32 years ⋮ A linear-time branching-time perspective on interface automata ⋮ \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Essential transitions to bisimulation equivalences ⋮ The algebra of communicating processes with empty process ⋮ Notes on the methodology of CCS and CSP ⋮ Process algebra with propositional signals ⋮ Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap ⋮ Keep it fair: equivalence and composition ⋮ Nested-unit Petri nets ⋮ Event structure semantics for multiparty sessions ⋮ A fully abstract model for the exchange of information in multi-agent systems. ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ A trace-based service semantics guaranteeing deadlock freedom ⋮ Cartesian difference categories ⋮ A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A specification structure for deadlock-freedom of synchronous processes ⋮ Compositionality issues in discrete, continuous, and hybrid systems
This page was built for publication: A Theory of Communicating Sequential Processes
