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, Modal logics for communicating systems, Prespecification in data refinement, Refusal testing, An intensional characterization of the largest bisimulation, Observation equivalence as a testing equivalence, Fixed point equations with parameters in the projective model, Step failures semantics and a complete proof system, 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, Bisimulation and divergence, An operational semantics for paragon: A design notation for parallel architectures, Failures semantics based on interval semiwords is a congruence for refinement, Recursive process definitions with the state operator, Receptive process theory, A weakest precondition semantics for communicating processes, Algèbre de processus et synchronisation, Port automata and the algebra of concurrent porcesses, A fair calculus of communicating systems, Parametric channels via label expressions in CCS, A linear-history semantics for languages for distributed programming, A theory of bipolar synchronization scheme, A logical characterization of observation equivalence, Priorities in process algebras, On guarded recursion, A model of concurrency with fair merge and full recursion, Process algebra and constraint programming for modeling interactions in MAS, A basic algebra of stateless connectors, Duplication of constants in process algebra, Fair testing, Generating the syntactic and semantics graphs for a Markovian process algebra, A criterion for atomicity revisited, Combining data type and recursive process specifications using projection algebras, Towards a theory of (self) applicative communicating processes: A short note, A refinement calculus for specifications in Hennessy-Milner logic with recursion, Automated analysis of mutual exclusion algorithms using CCS, Process simulation and refinement, Proof systems for satisfiability in Hennessy-Milner logic with recursion, Some behavioural aspects of net theory, Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems), A partial ordering semantics for CCS, Algebraic specification of concurrent systems, A rewriting strategy to verify observational congruence, Interpreting one concurrent calculus in another, Step semantics for ``true concurrency with recursion, CCS expressions, finite state processes, and three problems of equivalence, Contractions in comparing concurrency semantics, A design method for embedded software systems, Reasoning about networks with many identical finite state processes, On finite alphabets and infinite bases, Generalizing the Paige-Tarjan algorithm by abstract interpretation, Formalization of test experiments, CPO semantics of timed interactive actor networks, On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP, Fully abstract models and refinements as tools to compare agents in timed coordination languages, A Rice-style theorem for parallel automata, Refinement and verification in component-based model-driven design, Calculi for synchrony and asynchrony, Axiomatising finite delay operators, Models of programs and processes, A complete inference system for a class of regular behaviours, Non-deterministic data types: Models and implementations, On the suitability of trace semantics for modular proofs of communicating processes, A proof-theoretic characterization of observational equivalence, A language for linking modules into systems, Specification-oriented semantics for communicating processes, Determinacy $\to$ (observation equivalence $=$ trace equivalence), Hierarchical verification of asynchronous circuits using temporal logic, Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets, On interprocess communication. I: Basic formalism, A model and temporal proof system for networks of processes, A theory for nondeterminism, parallelism, communication, and concurrency, Merging regular processes by means of fixed-point theory, Algebraic calculi of processes and net expressions, About fair asynchrony, An algebraic theory of fair asynchronous communicating processes, A context dependent equivalence between processes, Specification and top-down design of distributed systems, Bisimulations and abstraction homomorphisms, On the consistency of Koomen's fair abstraction rule, Petri nets, algebras, morphisms, and compositionality, Infinite streams and finite observations in the semantics of uniform concurrency, Communication in concurrent dynamic logic, An algebra of processes, Rewriting with a nondeterministic choice operator, Unnamed Item, A categorical manifesto, 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, 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, Weak and strong fairness in CCS, Decentralized supervisory control of discrete-event systems, Fixed points in free process algebras. I, Bisimulation of automata, Denotational semantics of communicating processes based on a language for applicative multiprogramming, 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., Infinite behaviour of Petri nets, Testing equivalence as a bisimulation equivalence, Syntax and consistent equation semantics of hybrid Chi, Compositionality of Hennessy-Milner logic by structural operational semantics, Behavioral complexity indicators for process algebra: The NKS approach, Operational semantics of Framed Tempura, The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems, Comparative branching-time semantics for Markov chains, Deciding orthogonal bisimulation, Thread algebra for strategic interleaving, A semantic framework for open processes, Denotational semantics for thread algebra, Notions of bisimulation and congruence formats for SOS with data, Pure bigraphs: structure and dynamics, On the expressiveness of higher dimensional automata, Approximating and computing behavioural distances in probabilistic transition systems, Verification of system level model transformations, Bisimulation for labelled Markov processes, 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, Determinism $\to$ (event structure isomorphism $=$ step sequence equivalence), Interleaving set temporal logic, Concurrent bisimulations in Petri nets, A compositional proof system on a category of labelled transition systems, Real time process algebra, Compositionality issues in discrete, continuous, and hybrid systems, A mathematical model for system design and refinement, Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Branching vs. Linear Time: Semantical Perspective, Model Based Importance Analysis for Minimal Cut Sets, A Rule Format for Associativity, A Ticking Clock: Performance Analysis of a Circadian Rhythm with Stochastic Process Algebra, Model Driven Testing Based on Test History, Challenges in the Specification of Full Contracts, PRISMA: A Mobile Calculus with Parametric Synchronization, Decidable Extensions of Hennessy-Milner Logic, New Bisimulation Semantics for Distributed Systems, On Communicating Finite-State Machines, An interpreter for LOTOS, a specification language for distributed systems, Fairness and regularity for SCCS processes, Message passing communication versus procedure call communication, Unnamed Item, Unnamed Item, A note on causal trees and their applications to CCS, On the analysis of cooperation and antagonism in networks of communicating processes, The complexity of reachability in distributed communicating processes, Cause-effect structures, An introduction to the regular theory of fairness, On the existence of delay-insensitive fair arbiters: Trace theory and its limitations, On observability of discrete-event systems, Trace, failure and testing equivalences for communicating processes, Global renaming operators in concrete process algebra, Applications of compactness in the Smyth powerdomain of streams, Semantics of production systems, A distributed operational semantics of CCS based on condition/event systems, Partial ordering models for concurrency can be defined operationally, A state-based approach to communicating processes, Metric semantics for concurrency, An incompleteness result in process algebra, The equational theory of pomsets, Stable families of behavioural equivalences, Sequential and concurrent behaviour in Petri net theory, Concurrent transition systems, Introduction to the theory of nested transactions, Hiding in stream semantics of uniform concurrency, Characterizing finite Kripke structures in propositional temporal logic, Type theory and concurrency, Concurrency and atomicity, 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, Modelling knowledge and action in distributed systems, Submodule construction as equation solving in CCS, A complete axiomatisation for observational congruence of finite-state behaviours, 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., On the corrective control of sequential machines, The design and use of a prolog trace generator for CSP, Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages, On the control of incompletely described sequential machines, A Finite Axiomatization of Nondeterministic Regular Expressions, Model Checking for Action Abstraction, 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