A calculus of communicating systems

Publication date: 1980

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

concurrent systems; CSP; observational equivalence; CCS; communicating systems; concurrent composition; silent transition; synchronized communications

Mathematics Subject Classification ID

68-02: Research exposition (monographs, survey articles) pertaining to computer science

68N25: Theory of operating systems

Related Items

Measuring the confinement of probabilistic systems, Strong normalisation in the \(\pi\)-calculus, Confluence for process verification, Structural operational semantics for weak bisimulations, Compilation of the ELECTRE reactive language into finite transition systems, Late and early semantics coincide for testing, Deciding observational congruence of finite-state CCS expressions by rewriting, Translations between modal logics of reactive systems, Structure of concurrency, Transition system specifications with negative premises, Modal logics for mobile processes, The expressive power of implicit specifications, Universal axioms for bisimulations, Computational interpretations of linear logic, Refinement of actions in event structures and causal trees, Communicating processes with value-passing and assignments, Category theory for operational semantics, On the computational complexity of bisimulation, redux, Shuffle on trajectories: Syntactic constraints, Domain theory in logical form, Bisimulation through probabilistic testing, Factorisation of finite state machines under strong and observational equivalences, Correctness of concurrent processes, Completing the temporal picture, The equivalence in the DCP model, Co-induction in relational semantics, Partial specifications and compositional verification, An algebra of concurrent non-deterministic processes, A proof system for communicating processes with value-passing, Compositionality and bisimulation: A negative result, An agent calculus with simple actions where the enabling and disabling are derived operators, \(\tau\)-bisimulations and full abstraction for refinement of actions, Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule, Concurrent regular expressions and their relationship to Petri nets, Dynamic algebras: Examples, constructions, applications, Symbolic model checking: \(10^{20}\) states and beyond, A compositional protocol verification using relativized bisimulation, Proof systems for infinite behaviours, Algebraic and functional specification of an interactive serializable database interface, Maximality preserving bisimulation, Fairness, distances and degrees, Strong fairness and ultra metrics, Experimenting with process equivalence, Causal automata, Finitary logics for some CCS observational bisimulations, Structured operational semantics and bisimulation as a congruence, An algebraic semantics for structured transition systems and its application to logic programs, An algebraic characterisation of elementary net system (observable) state space, Deciding bisimilarity is P-complete, Enriched categorical semantics for distributed calculi, Representation of computations in concurrent automata by dependence orders, Partial confluence of processes and systems of objects, Group axioms for iteration, A shorter proof to uniqueness of solutions of equations, Topology, domain theory and theoretical computer science, Computation paths logic: An expressive, yet elementary, process logic, A complete modal proof system for HAL: the Herbrand agent language, A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol, The connection between an event structure semantics and an operational semantics for TCSP, Plain CHOCS. A second generation calculus for higher order processes, Elementary transition systems and refinement, Model checking for action-based logics, Relation-based semantics for concurrency, A theory of processes with localities, On sequential composition, action prefixes and process prefix, Natural discrete-event process forecasting: A decision support system, Bisimulation is two-way simulation, A complete equational axiomatization for prefix iteration, Denotational semantics in the cpo and metric approach, Labelled domains and automata with concurrency, Property preserving abstractions for the verification of concurrent systems, Synchronization trees, Testing equivalences for processes, Formal specification of parallel SIMD execution, On reduction-based process semantics, On the operational semantics of nondeterminism and divergence, Branching bisimilarity is an equivalence indeed!, A \(\pi\)-calculus with explicit substitutions, Actors, actions, and initiative in normative system specification, An equational axiomatization for multi-exit iteration, A complete axiomatization of finite-state ACSR processes, Confluence in concurrent constraint programming, Processes are in the eye of the beholder, Formal verification of a leader election protocol in process algebra, A semantic theory for value-passing processes based on the late approach, Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay, Encoding transition systems in sequent calculus, TTL: A modular language for hardware/software systems design., Undecidability of domino games and hhp-bisimilarity., New architectures for constructed complex systems, A computer scientist looks at game theory., Mathematical modal logic: A view of its evolution, Domain theory for concurrency, Mobile ambients, Towards a unified view of bisimulation: A comparative study, A complexity analysis of bisimilarity for value-passing processes, Weak confluence and \(\tau\)-inertness, Language preorder as a precongruence, Universal coalgebra: A theory of systems, Relational transducers for electronic commerce, Unnamed Item, A categorical manifesto, On the corrective control of sequential machines, On the control of incompletely described sequential machines, A Finite Axiomatization of Nondeterministic Regular Expressions, A fully abstract denotational model for observational precongruence, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Pushdown automata, multiset automata, and Petri nets, Objects and their lambda calculus, A process-calculus analysis of concurrent operations on B-trees, Inheritance of behavior, Real time process algebra with time-dependent conditions, Compositional priority specification in real-time distributed systems., Branching time controllers for discrete event systems, Recursive equations in higher-order process calculi, Free \(\mu\)-lattices, Noninterference for concurrent programs and thread systems, A truly concurrent semantics for a process algebra using resource pomsets, Compositional SOS and beyond: A coalgebraic view of open systems, Resource traces: A domain for processes sharing exclusive resources., Bisimulation indexes and their applications, Hiding resources that can fail: An axiomatic perspective, Additive models of probabilistic processes, Operational and abstract semantics of the query language G-Log, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Hybrid process algebra, A hierarchy of failures-based models: theory and application, A hierarchy of equivalences for asynchronous calculi, A brief history of process algebra, Observational congruences for dynamically reconfigurable tile systems, Modular specification of process algebras, Locked discrete event systems: How to model and how to unlock, A partial order approach to branching time logic model checking., Alternation and bounded concurrency are reverse equivalent., Toward an infinitary logic of domains: Abramsky logic for transition systems, Strong fairness and full abstraction for communicating processes, On the complexity of verifying concurrent transition systems, Ordered SOS process languages for branching and eager bisimulations, The origins of structural operational semantics, Axiomatizing GSOS with termination, A theory of bisimulation for a fragment of concurrent ML with local names, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, Branching time and orthogonal bisimulation equivalence, De Bakker-Zucker processes revisited, Logic of transition systems, Trace nets and process automata, On logics with two variables, Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus, Bisimulation for probabilistic transition systems: A coalgebraic approach, Game-theoretic analysis of call-by-value computation, Topology in process calculus. I: Limit behaviour of agents, Deciding bisimilarity and similarity for probabilistic processes., Testing equivalence as a bisimulation equivalence, Comparative branching-time semantics for Markov chains, Notions of bisimulation and congruence formats for SOS with data, Hierarchical control of discrete-event systems, Synchronized shuffles, \(\pi\)-calculus with noisy channels, Polarized process algebra with reactive composition, A tutorial on coinductive stream calculus and signal flow graphs, Compositionality issues in discrete, continuous, and hybrid systems, Unnamed Item, Unnamed Item, A note on causal trees and their applications to CCS