Process Algebra

DOI10.1017/CBO9780511624193zbMath0716.68002OpenAlexW4244719572MaRDI QIDQ3999164

W. P. Weijland, Jos C. M. Baeten

Publication date: 23 January 1993

Full work available at URL: https://doi.org/10.1017/cbo9780511624193

zbMATH Keywords

concurrent processesconcurrencyProcess Algebracommunicating processes

Mathematics Subject Classification ID

Related Items (only showing first 100 items - show all)

Real space process algebra ⋮ Process algebra with guards: Combining hoare logic with process algebra ⋮ GSOS and finite labelled transition systems ⋮ On sequential composition, action prefixes and process prefix ⋮ Kleene's three-valued logic and process algebra ⋮ Regularity of normed PA processes ⋮ Bisimulation is two-way simulation ⋮ Focus points and convergent process operators: A proof strategy for protocol verification ⋮ Branching bisimilarity is an equivalence indeed! ⋮ Actors, actions, and initiative in normative system specification ⋮ Formalizing process algebraic verifications in the calculus of constructions ⋮ Cones and foci: A mechanical framework for protocol verification ⋮ Full abstraction and recursion ⋮ Duplication of constants in process algebra ⋮ Preferential choice and coordination conditions ⋮ Model checking a cache coherence protocol of a Java DSM implementation ⋮ An equational axiomatization for multi-exit iteration ⋮ Fair testing ⋮ Approximate analyzing of labeled transition systems ⋮ Bisimulation on speed: Worst-case efficiency ⋮ SOS formats and meta-theory: 20 years after ⋮ Shuffle on trajectories: Syntactic constraints ⋮ Processes with infinite liveness requirements ⋮ Tree shuffle ⋮ The equational logic of fixed points ⋮ The algebra of communicating processes with empty process ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Process algebra with propositional signals ⋮ Process algebra with language matching ⋮ Formal verification of a leader election protocol in process algebra ⋮ Two finite specifications of a queue ⋮ Revisiting sequential composition in process calculi ⋮ Revisiting timing in process algebra. ⋮ A pure labeled transition semantics for the applied pi calculus ⋮ Specifying termination in CSP ⋮ Theory of interaction ⋮ Analysis of a distributed system for lifting trucks. ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ A quantitative study of pure parallel processes ⋮ Rule formats for determinism and idempotence ⋮ The infinite evolution mechanism of \(\epsilon\)-bisimilarity ⋮ Parametric synchronizations in mobile nominal calculi ⋮ Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule ⋮ Confluence for process verification ⋮ A complete axiomatization of timed bisimulation for a class of timed regular behaviours ⋮ Structural operational semantics for weak bisimulations ⋮ Verification of well-formed communicating recursive state machines ⋮ A theory of processes with durational actions ⋮ A process algebraic view of input/output automata ⋮ Petri net semantics of priority systems ⋮ On the expressiveness of interaction ⋮ Partial order semantics for use case and task models ⋮ Hybrid process algebra ⋮ Contexts, refinement and determinism ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Derivation tree analysis for accelerated fixed-point computation ⋮ Fixing Zeno gaps ⋮ The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) ⋮ Category theory for operational semantics ⋮ On the computational complexity of bisimulation, redux ⋮ An exact correspondence between a typed pi-calculus and polarised proof-nets ⋮ Relating fair testing and accordance for service replaceability ⋮ A precongruence format for should testing preorder ⋮ A randomized encoding of the \(\pi\)-calculus with mixed choice ⋮ The expressive power of the shuffle product ⋮ Verification of reactive systems via instantiation of parameterised Boolean equation systems ⋮ Qualitative reachability in stochastic BPA games ⋮ A brief history of process algebra ⋮ Process algebra for hybrid systems ⋮ On the usability of process algebra: An architectural view ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation ⋮ An algebra of hybrid systems ⋮ Probabilistic mobile ambients ⋮ Modular specification of process algebras ⋮ Processes with local and global liveness requirements ⋮ Generating priority rewrite systems for OSOS process languages ⋮ (Bi)simulations up-to characterise process semantics ⋮ A note on an expressiveness hierarchy for multi-exit iteration ⋮ Algebra and theory of order-deterministic pomsets ⋮ Action transducers and timed automata ⋮ A conservative look at operational semantics with variable binding ⋮ Operational and denotational semantics for the box algebra ⋮ A complete equational axiomatization for MPA with string iteration ⋮ A decision algorithm for distributive unification ⋮ A behavioural theory of first-order CML ⋮ Finite axiom systems for testing preorder and De Simone process languages ⋮ Effective decomposability of sequential behaviours ⋮ Swinging types=functions+relations+transition systems ⋮ Language preorder as a precongruence ⋮ A hidden agenda ⋮ Discrete time generative-reactive probabilistic processes with different advancing speeds ⋮ Bisimilarity of open terms. ⋮ Bisimulation indexes and their applications ⋮ Process algebra and conditional composition ⋮ Impossible futures and determinism ⋮ Equivalence of recursive specifications in process algebra ⋮ A formal approach to object-oriented software engineering

This page was built for publication: Process Algebra