A Theory of Communicating Sequential Processes
From MaRDI portal
Publication:3765233
DOI10.1145/828.833zbMath0628.68025WikidataQ56210213 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
68N25: Theory of operating systems
Related Items
A fully abstract may testing semantics for concurrent objects, Modal logics for communicating systems, Refusal testing, The pursuit of deadlock freedom, Step failures semantics and a complete proof system, Structural operational semantics for weak bisimulations, A theory of processes with durational actions, On the nature of events: another perspective in concurrency, A stubborn attack on state explosion, Universal axioms for bisimulations, Communicating processes with value-passing and assignments, A note on the notation of recursion in process algebras, Refinement, conformance and inheritance, Failures semantics based on interval semiwords is a congruence for refinement, A linear-history semantics for languages for distributed programming, Comparative semantics for flow of control in logic programming without logic, Process algebra and constraint programming for modeling interactions in MAS, Complexity of reachability problems for finite discrete dynamical systems, Duplication of constants in process algebra, Preferential choice and coordination conditions, Fair testing, Conjunction on processes: Full abstraction via ready-tree semantics, Process simulation and refinement, A partial ordering semantics for CCS, CCS expressions, finite state processes, and three problems of equivalence, A design method for embedded software systems, Relational structures model of concurrency, Calculi for synchrony and asynchrony, A more complete model of communicating processes, A complete inference system for a class of regular behaviours, On the suitability of trace semantics for modular proofs of communicating processes, A proof-theoretic characterization of observational equivalence, Specification-oriented semantics for communicating processes, Determinacy \(\to\) (observation equivalence \(=\) trace equivalence), A logic for the specification and proof of regular controllable processes of CCS, About fair asynchrony, Denotational semantics of communicating sequential programs, A context dependent equivalence between processes, Concurrent histories: a basis for observing distributed systems, Specification and top-down design of distributed systems, Infinite streams and finite observations in the semantics of uniform concurrency, Specification and verification of database dynamics, Communication in concurrent dynamic logic, On the analysis of cooperation and antagonism in networks of communicating processes, Verification of a class of self-timed computational networks, Trace, failure and testing equivalences for communicating processes, Global renaming operators in concrete process algebra, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, A timed model for communicating sequential processes, Partial ordering models for concurrency can be defined operationally, A state-based approach to communicating processes, The equational theory of pomsets, Stable families of behavioural equivalences, Compositional semantics for real-time distributed computing, Hiding in stream semantics of uniform concurrency, Type theory and concurrency, Concurrency and atomicity, Correctness of concurrent processes, The equivalence in the DCP model, Partial specifications and compositional verification, Specification styles in distributed systems design and verification, An algebra of concurrent non-deterministic processes, Minimizing the number of transitions with respect to observation equivalence, Semantics for data parallel computation, Enriched categorical semantics for distributed calculi, Unique decomposition of processes, From algebra to operational semantics, Failure-equivalent transformation of transition systems to avoid internal actions, Submodule construction as equation solving in CCS, A complete axiomatisation for observational congruence of finite-state behaviours, The timed failures -- Stability model for CSP, A fully abstract semantics for concurrent constraint programming, Exact performance equivalence: An equivalence relation for stochastic automata, Basic observables for processes, Topology, domain theory and theoretical computer science, On deciding trace equivalences for processes, The connection between an event structure semantics and an operational semantics for TCSP, Infinitary parallelism without unbounded nondeterminism in CSP, A fully abstract trace model for dataflow and asynchronous networks, On sequential composition, action prefixes and process prefix, When is partial trace equivalence adequate?, Property preserving abstractions for the verification of concurrent systems, Synchronization trees, Testing equivalences for processes, On the operational semantics of nondeterminism and divergence, Two implementation relations and the correctness of communicating replicated processes, Deciding true concurrency equivalences on safe, finite nets, Quiescence, fairness, testing, and the notion of implementation, Complexity of equivalence problems for concurrent systems of finite agents, 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, A fully abstract model for the exchange of information in multi-agent systems., Reachability problems for sequential dynamical systems with threshold functions., Linda-based applicative and imperative process algebras, A truly concurrent semantics for a process algebra using resource pomsets, A brief history of process algebra, Progress assumption in concurrent systems, Amalgamation of graph transformations: a synchronization mechanism, Quantales, observational logic and process semantics, Unnamed Item, On deciding some equivalences for concurrent processes, Process algebra with four-valued logic, Maurer computers for pipelined instruction processing, Journeys in non-classical computation I: A grand challenge for computing research, 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, Underspecification for a simple process algebra of recursive processes., Denotational semantics of communicating processes based on a language for applicative multiprogramming, Bisimilarity of open terms., Inductive synthesis of recursive processes from logical properties, Strong fairness and full abstraction for communicating processes, Vertical implementation, Axiomatizing GSOS with termination, Asynchronous communication model based on linear logic, 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, Discrete time process algebra, A specification structure for deadlock-freedom of synchronous processes, Deciding bisimilarity and similarity for probabilistic processes., Compositionality of Hennessy-Milner logic by structural operational semantics, Thread algebra for strategic interleaving, Belnap's logic and conditional composition, Full abstraction for polymorphic \(\pi \)-calculus, Integrating a formal method into a software engineering process with UML and Java, Pure bigraphs: structure and dynamics, Splitting bisimulations and retrospective conditions, Parallelization alternatives and their performance for the convex hull problem, Probabilistic temporal logics via the modal mu-calculus, \(\pi\)-calculus with noisy channels, Polarized process algebra with reactive composition, Axiomatising divergence, A compositional proof system on a category of labelled transition systems, Compositionality issues in discrete, continuous, and hybrid systems, Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, A ground-complete axiomatisation of finite-state processes in a generic process algebra, On Finite Bases for Weak Semantics: Failures Versus Impossible Futures, Safe Reasoning with Logic LTS, Multiple Viewpoint Contract-Based Specification and Design, Refined Interfaces for Compositional Verification, Contracts for BIP: Hierarchical Interaction Models for Compositional Verification, On the Expressive Power of Restriction and Priorities in CCS with Replication, Unnamed Item
