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)
- 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
- \(\pi\)-calculus with noisy channels
- A state-based approach to communicating processes
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Synchronization trees
- The timed failures -- Stability model for CSP
- Calculi for synchrony and asynchrony
- Kleene's three-valued logic and process algebra
- Developments in concurrent Kleene algebra
- CCS expressions, finite state processes, and three problems of equivalence
- A theory of processes with durational actions
- Pure bigraphs: structure and dynamics
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Property preserving abstractions for the verification of concurrent systems
- A stubborn attack on state explosion
- Communication in concurrent dynamic logic
- Complexity of equivalence problems for concurrent systems of finite agents
- The pursuit of deadlock freedom
- Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
- Testing equivalences for processes
- Splitting bisimulations and retrospective conditions
- Divergence and fair testing
- A timed model for communicating sequential processes
- Communicating parallel processes
- Bisimilarity of open terms.
- Reversible session-based pi-calculus
- Thread algebra for strategic interleaving
- The equational theory of pomsets
- A trace-based service semantics guaranteeing deadlock freedom
- Submodule construction as equation solving in CCS
- The connection between an event structure semantics and an operational semantics for TCSP
- Title not available (Why is that?)
- Compositionality issues in discrete, continuous, and hybrid systems
- Process algebra with propositional signals
- Deciding bisimilarity and similarity for probabilistic processes.
- A brief history of process algebra
- Topology, domain theory and theoretical computer science
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Communicating processes with value-passing and assignments
- Universal axioms for bisimulations
- Remarks on testing probabilistic processes
- Undecidability results for deterministic communicating sequential processes
- Models and emerging trends of concurrent constraint programming
- Compositional verification of asynchronous concurrent systems using CADP
- Two-thirds simulation indexes and modal logic characterization
- Complexity of reachability problems for finite discrete dynamical systems
- Trace, failure and testing equivalences for communicating processes
- Basic observables for processes
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Fair testing
- Linda-based applicative and imperative process algebras
- A complete inference system for a class of regular behaviours
- Specification-oriented semantics for communicating processes
- On the Expressive Power of Restriction and Priorities in CCS with Replication
- Minimizing the number of transitions with respect to observation equivalence
- Structural operational semantics for stochastic and weighted transition systems
- Deadlock detection in linear recursive programs
- Confluence thanks to extensional determinism
- Compositional failure-based semantic models for basic LOTOS
- Safe reasoning with logic LTS
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- 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
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)
