Process algebra for synchronous communication

DOI10.1016/S0019-9958(84)80025-XzbMath0597.68027OpenAlexW1972478730MaRDI QIDQ3731022

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80025-x

zbMATH Keywords

rewrite system interleaving mutual exclusion equational specification algebraic theory of processes communication algebra free merge synchronous process cooperation

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Modelling and analysing neural networks using a hybrid process algebra, Real space process algebra, Process algebra with guards: Combining hoare logic with process algebra, On sequential composition, action prefixes and process prefix, Kleene's three-valued logic and process algebra, Developments in concurrent Kleene algebra, A complete equational axiomatization for prefix iteration, Infinite streams and finite observations in the semantics of uniform concurrency, A \(\pi\)-calculus with explicit substitutions, Actors, actions, and initiative in normative system specification, Global renaming operators in concrete process algebra, Applications of compactness in the Smyth powerdomain of streams, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Designing equivalent semantic models for process creation, Bisimilarity is not finitely based over BPA with interrupt, Partial ordering models for concurrency can be defined operationally, Duplication of constants in process algebra, Preferential choice and coordination conditions, A generalization of ACP using Belnap's logic, An incompleteness result in process algebra, Nested semantics over finite trees are equationally hard, SOS formats and meta-theory: 20 years after, Generating the syntactic and semantics graphs for a Markovian process algebra, Execution architectures for program algebra, Shuffle on trajectories: Syntactic constraints, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, A process calculus with finitary comprehended terms, Decision problems for pushdown threads, The algebra of communicating processes with empty process, A general conservative extension theorem in process algebras with inequalities, Process algebra with propositional signals, Termination modulo equations by abstract commutation with an application to iteration, Process algebra with language matching, A pure labeled transition semantics for the applied pi calculus, Generating symbolic traces in the insertion modeling system, An axiomatic semantics for the synchronous language Gentzen., A fully abstract model for the exchange of information in multi-agent systems., Product line process theory, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, Rule formats for determinism and idempotence, Issues in the design of a parallel object-oriented language, Denotational semantics of a parallel object-oriented language, Structural operational semantics through context-dependent behaviour, Unifying theories of time with generalised reactive processes, A\(^ 2\)CCS: Atomic actions for CCS, A partial ordering semantics for CCS, Step semantics for ``true concurrency with recursion, A timed calculus for wireless systems, Modeling and verification of reconfigurable printing system based on process algebra, Compositional semantics and behavioral equivalences for P systems, Formal communication elimination and sequentialization equivalence proofs for distributed system models, Algebraic and fixed point equations over inverse limits of algebras, Verification of asynchronous systems with an unspecified component, Reversible session-based pi-calculus, Observational structures and their logic, Experimenting with process equivalence, Universal axioms for bisimulations, An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems, Automatic verification of distributed systems: the process algebra approach., An algebra for process creation, Mitigating covert channels based on analysis of the potential for communication, Rule formats for distributivity, A type system for counting instances of software components, CCS with Hennessy's merge has no finite-equational axiomatization, On the computational strength of pure ambient calculi, Lifting non-finite axiomatizability results to extensions of process algebras, On the axiomatizability of priority. II, SOS rule formats for zero and unit elements, Derivation tree analysis for accelerated fixed-point computation, Verification of mobile ad hoc networks: an algebraic approach, The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \), A brief history of process algebra, Decomposition orders -- another generalisation of the fundamental theorem of arithmetic, A thread calculus with molecular dynamics, Refusal testing, An operational semantics for object-oriented concepts based on the class hierarchy, Risk assessment for one-counter threads, The semantics of the combination of atomized statements and parallel choice, Failures semantics based on interval semiwords is a congruence for refinement, Recursive process definitions with the state operator, A fully abstract semantics for concurrent constraint programming, Reasoning about nondeterministic and concurrent actions: A process algebra approach, A general theory of action languages, Linda-based applicative and imperative process algebras, Finite axiom systems for testing preorder and De Simone process languages, Language preorder as a precongruence, An upper bound for the equational specification of finite state services, The compression structure of a process, On deciding trace equivalences for processes, Priorities in process algebras, Algebra of communicating processes with abstraction, A causal semantics for CCS via rewriting logic, The cones and foci proof technique for timed transition systems, Process algebra and conditional composition, Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Process algebra and constraint programming for modeling interactions in MAS, Proving finiteness of CCS processes by non-standard semantics, The connection between an event structure semantics and an operational semantics for TCSP, On the expressiveness of choice quantification, Pushdown Automata and Context-Free Grammars in Bisimulation Semantics, Axiomatizing GSOS with termination, Termination, deadlock and divergence, Computable processes and bisimulation equivalence, Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types, The Equational Theory of Weak Complete Simulation Semantics over BCCSP, Branching time and orthogonal bisimulation equivalence, Behavioral complexity indicators for process algebra: The NKS approach, Axiomatizing recursion-free, regular monitors, Processes with multiple entries and exits, Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, Logic of transition systems, Trace Semantics for IPDL, Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, A domain equation for bisimulation, Real time process algebra, Undecidable equivalences for basic parallel processes, Efficient symbolic computation of process expressions, Newton series, coinductively: a comparative study of composition, Discrete time process algebra, A formal framework for distributed cyber-physical systems, Axiomatizations for the perpetual loop in process algebra, Sheaf semantics for concurrent interacting objects, Categorical shape theory as a formal language for pattern recognition?, A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency, Partial-order reduction in the weak modal mu-calculus, A survey on compositional algorithms for verification and synthesis in supervisory control, Nested-unit Petri nets, On the axiomatisability of priority. III: Priority strikes again, Independence Abstractions and Models of Concurrency, Expressiveness modulo bisimilarity of regular expressions with parallel composition, SOS rule formats for idempotent terms and idempotent unary operators, Unnamed Item, Psi-calculi in Isabelle, A wide-spectrum language for object-based development of real-time systems, Algebra of timed frames, Unnamed Item, Unnamed Item, A Context-Free Process as a Pushdown Automaton, Axiomatizing weak simulation semantics over BCCSP, A ground-complete axiomatisation of finite-state processes in a generic process algebra, Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity, Causal Unfoldings, Thread algebra for strategic interleaving, Synchronous cooperation for explicit multi-threading, Belnap's logic and conditional composition, On dynamically generated ontology translators in agent communication, Network algebra for asynchronous dataflow^∗, Denotational semantics for thread algebra, Temporal Logic with Recursion., CCS with priority guards, Conflict vs causality in event structures, Using Hoare Logic in a Process Algebra Setting, Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination, Process algebra with strategic interleaving, A Basic Parallel Process as a Parallel Pushdown Automaton, On recursive operations over logic LTS, Bochvar-McCarthy logic and process algebra, Leader election in rings of ambient processes, Inheritance of behavior, Real time process algebra with time-dependent conditions, Linearization in parallel pCRL, Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems, Splitting bisimulations and retrospective conditions, Unnamed Item, A process calculus BigrTiMo of mobile systems and its formal semantics, An introduction to compositional methods for concurrency and their application to real-time., Models and logics for true concurrency., An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation, Non-regular iterators in process algebra, An axiomatic semantics for Esterel, Systems specification by basic protocols, Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study, Models and languages for description of parallel processes, Proved trees, Parameterized verification of monotone information systems, On the axiomatisability of priority, Maurer computers for pipelined instruction processing, Process algebra with four-valued logic, Temporal logic with recursion, Hunting Distributed Malware with the κ-Calculus, Fixed points in free process algebras. I, Bisimulation of automata, Automatic proofs by induction in theories without constructors, Axiomatizing Weak Ready Simulation Semantics over BCCSP, A Petri net view of covalent bonds, Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal, Polarized process algebra with reactive composition, Inductive synthesis of recursive processes from logical properties, Trace and testing equivalence on asynchronous processes, Ordered SOS process languages for branching and eager bisimulations, Compositional Assume-Guarantee Reasoning of Control Law Diagrams Using UTP, Program algebra for sequential code, The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems, A Generic Process Algebra, A Generalization of ACP Using Belnap's Logic, Parallel Processes with Implicit Computational Capital, A Calculus for Team Automata, Modular rewritable Petri nets: an efficient model for dynamic distributed systems, A model of actors and grey failures, Back to the format: a survey on SOS for probabilistic processes, Refinement in Interworkings, Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction, Equivalence checking 40 years after: a review of bisimulation tools, A fine-grained semantics for arrays and pointers under weak memory models, On (left) partial shuffle