Algebra of communicating processes with abstraction

DOI10.1016/0304-3975(85)90088-XzbMath0579.68016OpenAlexW2158942489MaRDI QIDQ1067408

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90088-x

zbMATH Keywords

process algebra bisimulation concurrency process graphs communicating processes rewrite rules equational axiom system handshaking internal actions recursive path orderings terminating

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Related Items

A theory of processes with localities, Computable processes and bisimulation equivalence, Verification of \(\mathrm{EB}^3\) specifications using CADP, A fixpoint theory for non-monotonic parallelism, Branching time and orthogonal bisimulation equivalence, DP lower bounds for equivalence-checking and model-checking of one-counter automata, On the consistency of Koomen's fair abstraction rule, On process equivalence = equation solving in CCS, Resources in process algebra, Composing models, Automatizing parametric reasoning on distributed concurrent systems, Using integer programming to verify general safety and liveness properties, Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC, Rewriting with a nondeterministic choice operator, On the operational semantics of nondeterminism and divergence, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Algebraic solutions to recursion schemes, Unification problems with one-sided distributivity, Actors, actions, and initiative in normative system specification, Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence), Modelling and verifying the AODV routing protocol, Cones and foci: A mechanical framework for protocol verification, A theory of bisimulation for the \(\pi\)-calculus, Global renaming operators in concrete process algebra, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Combine and conquer: relating BIP and Reo, Preferential choice and coordination conditions, An incompleteness result in process algebra, An equational axiomatization for multi-exit iteration, Behavioural equivalences of a probabilistic pi-calculus, A complete axiomatization of finite-state ACSR processes, Control protocol synthesis for multi-agent systems with similar actions instantiated from agent and requirement templates, An abstract interpretation toolkit for \(\mu\)CRL, Congruence from the operator's point of view. Syntactic requirements on modal characterizations, Off-the-shelf automated analysis of liveness properties for just paths, A process algebra of communicating shared resources with dense time and priorities, Essential transitions to bisimulation equivalences, The algebra of communicating processes with empty process, A general conservative extension theorem in process algebras with inequalities, Termination modulo equations by abstract commutation with an application to iteration, Process algebra with language matching, Two finite specifications of a queue, Revisiting sequential composition in process calculi, Product line process theory, An algebra of behavioural types, Value-passing CCS with noisy channels, A calculus and logic of bunched resources and processes, Issues in the design of a parallel object-oriented language, SOS rule formats for idempotent terms and idempotent unary operators, Algebraic specification of concurrent systems, Discrete time stochastic and deterministic Petri box calculus dtsdPBC, Deriving structural labelled transitions for mobile ambients, Topology in process calculus. I: Limit behaviour of agents, Formal communication elimination and sequentialization equivalence proofs for distributed system models, The equivalence in the DCP model, Diagnosis from scenarios, \(\tau\)-bisimulations and full abstraction for refinement of actions, \(\pi\)-calculus, internal mobility, and agent-passing calculi, A compositional protocol verification using relativized bisimulation, Universal axioms for bisimulations, Observing localities, A calculus of mobile processes. I, CSP is a retract of CCS, Rule formats for distributivity, Partially-commutative context-free processes: expressibility and tractability, Enriched categorical semantics for distributed calculi, From algebra to operational semantics, On cool congruence formats for weak bisimulations, Fixing Zeno gaps, Pure bigraphs: structure and dynamics, Refinement of actions for real-time concurrent systems with causal ambiguity, The quest for minimal quotients for probabilistic and Markov automata, Connection between logical and algebraic approaches to concurrent systems, Modular specification of process algebras, TIC: a tImed calculus, LOTOS extended with probabilistic behaviours, Reactive Turing Machines, Performance evaluation in stochastic process algebra dtsdPBC, A decision algorithm for distributive unification, Fixed points in free process algebras. I, Bisimulation of automata, Finite axiom systems for testing preorder and De Simone process languages, The compression structure of a process, \(\pi\)-calculus with noisy channels, Polarized process algebra with reactive composition, Process rewrite systems., Algorithmic analysis of programs with well quasi-ordered domains., Specification-oriented semantics for communicating processes, Parallel Processes with Implicit Computational Capital, Models and emerging trends of concurrent constraint programming, Algebra of communicating processes with abstraction, Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems, Dynamic connectors for concurrency, Compositional verification of asynchronous concurrent systems using CADP, Bisimulation indexes and their applications, Additive models of probabilistic processes, A formal approach to object-oriented software engineering, A structural transformation from p-\(\pi\) to MSVL, Process algebra and constraint programming for modeling interactions in MAS, An algebraic approach for modelling organisation, roles and contexts in MAS, Termination, deadlock and divergence, Axiomatising real-timed processes, A technique for specifying and refining TCSP processes by using guards and liveness conditions, Testability of a communicating system through an environment, Property preserving abstractions under parallel composition, Process Algebra and Model Checking, An algorithm for distributive unification, Discrete time process algebra with abstraction, Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, Convenient category of processes and simulations I: Modulo strong bisimilarity, Graph-grammar semantics of a higher-order programming language for distributed systems, πI: A symmetric calculus based on internal mobility, Just testing, Infinite results, On relating concurrency and nondeterminism, On continuous time agents, Back to the format: a survey on SOS for probabilistic processes, Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction, Equivalence checking 40 years after: a review of bisimulation tools, Runners for interleaving algebraic effects, Unnamed Item, Fair expressions and regular languages over lists, Generating diagnostic information for behavioral preorders, A ground-complete axiomatisation of finite-state processes in a generic process algebra, Network algebra for asynchronous dataflow^∗, The Two-Phase Commitment Protocol in an Extended π-Calculus, Rewrite Systems with Constraints, Modularity and Implementation of Mathematical Operational Semantics, Hard Life with Weak Binders, Equivalence relations for modular performance evaluation in dtsPBC, Model checking usage policies, Pushdown automata, multiset automata, and Petri nets, Decidability of model checking with the temporal logic EF, Non-regular iterators in process algebra, Basic process algebra with deadlocking states, A Framework for Automatically Checking Anonymity with μCRL, Interleaving Strategies, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Modeling Routing Protocols in Adhoc Networks, A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes, A Generic Process Algebra, A Family of Resource-Bound Real-Time Process Algebras

Cites Work