A Theory of Communicating Sequential Processes
From MaRDI portal
Publication:3765233
DOI10.1145/828.833zbMath0628.68025OpenAlexW2102097307WikidataQ56210213 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
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, 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, Kleene's three-valued logic and process algebra, Concurrent histories: a basis for observing distributed systems, Specification and top-down design of distributed systems, Developments in concurrent Kleene algebra, 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, Complexity of reachability problems for finite discrete dynamical systems, 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, Duplication of constants in process algebra, Preferential choice and coordination conditions, Two-thirds simulation indexes and modal logic characterization, Fair testing, The equational theory of pomsets, Stable families of behavioural equivalences, Compositional semantics for real-time distributed computing, Hiding in stream semantics of uniform concurrency, Conjunction on processes: Full abstraction via ready-tree semantics, Type theory and concurrency, Concurrency and atomicity, Structural operational semantics for stochastic and weighted transition systems, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Translating FSP into LOTOS and networks of automata, Revisiting sequential composition in process calculi, An algebraic theory of interface automata, Specifying termination in CSP, To know or not to know: Epistemic approaches to security protocol verification, 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, Correctness of concurrent processes, Trace- and failure-based semantics for responsiveness, The equivalence in the DCP model, Partial specifications and compositional verification, Specification styles in distributed systems design and verification, Relational structures model of concurrency, An algebra of concurrent non-deterministic processes, Minimizing the number of transitions with respect to observation equivalence, Reversible session-based pi-calculus, An algebraic theory for web service contracts, Semantics for data parallel computation, 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, CSP is a retract of CCS, Combinatorics of labelling in higher-dimensional automata, 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, Unguardedness mostly means many solutions, On cool congruence formats for weak bisimulations, Safe reasoning with logic LTS, Relating fair testing and accordance for service replaceability, Ready to preorder: the case of weak process semantics, A fully abstract may testing semantics for concurrent objects, Modal logics for communicating systems, Ready simulation for concurrency: it's logical!, Refusal testing, The pursuit of deadlock freedom, Step failures semantics and a complete proof system, Generating priority rewrite systems for OSOS process languages, Submodule construction as equation solving in CCS, A complete axiomatisation for observational congruence of finite-state behaviours, A note on the notation of recursion in process algebras, Relational concurrent refinement. II: Internal operations and outputs, Refinement, conformance and inheritance, Failures semantics based on interval semiwords is a congruence for refinement, The timed failures -- Stability model for CSP, A fully abstract semantics for concurrent constraint programming, Specification completion for IOCO, Exact performance equivalence: An equivalence relation for stochastic automata, Basic observables for processes, Topology, domain theory and theoretical computer science, Calculi for synchrony and asynchrony, A more complete model of communicating processes, A complete inference system for a class of regular behaviours, A linear-history semantics for languages for distributed programming, 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), On deciding trace equivalences for processes, Comparative semantics for flow of control in logic programming without logic, Process algebra and constraint programming for modeling interactions in MAS, 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, A ground-complete axiomatisation of finite-state processes in a generic process algebra, Deciding bisimilarity and similarity for probabilistic processes., Thread algebra for strategic interleaving, Belnap's logic and conditional composition, Towards general axiomatizations for bisimilarity and trace semantics, Conditions of contracts for separating responsibilities in heterogeneous systems, The metric linear-time branching-time spectrum on nondeterministic probabilistic processes, Full abstraction for polymorphic \(\pi \)-calculus, Process algebra with strategic interleaving, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Anatomy of a domain of continuous random variables. I, Integrating a formal method into a software engineering process with UML and Java, Ensuring liveness properties of distributed systems: open problems, Pure bigraphs: structure and dynamics, On Finite Bases for Weak Semantics: Failures Versus Impossible Futures, Safe Reasoning with Logic LTS, Splitting bisimulations and retrospective conditions, A brief history of process algebra, Multiple Viewpoint Contract-Based Specification and Design, Parallelization alternatives and their performance for the convex hull problem, Schedulers and finishers: on generating and filtering the behaviours of an event structure, The How and Why of Interactive Markov Chains, 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, A linear-time-branching-time spectrum for behavioral specification theories, Error-pruning in interface automata, Automated verification of reactive and concurrent programs by calculation, Progress assumption in concurrent systems, Distributed Synthesis in Continuous Time, Amalgamation of graph transformations: a synchronization mechanism, Linda-based applicative and imperative process algebras, The Value-Passing Calculus, Generic Models of the Laws of Programming, Denotational semantics of communicating processes based on a language for applicative multiprogramming, Probabilistic temporal logics via the modal mu-calculus, \(\pi\)-calculus with noisy channels, Polarized process algebra with reactive composition, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, Bisimilarity of open terms., Inductive synthesis of recursive processes from logical properties, Strong fairness and full abstraction for communicating processes, Vertical implementation, Axiomatising divergence, Remarks on Testing Probabilistic Processes, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular, Models and emerging trends of concurrent constraint programming, A truly concurrent semantics for a process algebra using resource pomsets, Compositional verification of asynchronous concurrent systems using CADP, The connection between an event structure semantics and an operational semantics for TCSP, Infinitary parallelism without unbounded nondeterminism in CSP
