Process Algebra
From MaRDI portal
Publication:3999164
DOI10.1017/CBO9780511624193zbMath0716.68002MaRDI QIDQ3999164
Jos C. M. Baeten, W. P. Weijland
Publication date: 23 January 1993
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
08A70: Applications of universal algebra in computer science
Related Items
A randomized encoding of the \(\pi\)-calculus with mixed choice, Bisimulation on speed: Worst-case efficiency, Confluence for process verification, A complete axiomatization of timed bisimulation for a class of timed regular behaviours, Structural operational semantics for weak bisimulations, A theory of processes with durational actions, A process algebraic view of input/output automata, Category theory for operational semantics, On the computational complexity of bisimulation, redux, Cones and foci: A mechanical framework for protocol verification, Duplication of constants in process algebra, Preferential choice and coordination conditions, Model checking a cache coherence protocol of a Java DSM implementation, Fair testing, SOS formats and meta-theory: 20 years after, Parametric synchronizations in mobile nominal calculi, Verification of well-formed communicating recursive state machines, An algebra of hybrid systems, Probabilistic mobile ambients, Processes with local and global liveness requirements, Shuffle on trajectories: Syntactic constraints, Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule, Petri net semantics of priority systems, 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, 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, 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, Full abstraction and recursion, An equational axiomatization for multi-exit iteration, 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 timing in process algebra., 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., 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, 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, Hybrid process algebra, CCS with Hennessy's merge has no finite-equational axiomatization, A brief history of process algebra, Process algebra for hybrid systems, On the usability of process algebra: An architectural view, Modular specification of process algebras, Algebra and theory of order-deterministic pomsets, Action transducers and timed automata, Discrete time generative-reactive probabilistic processes with different advancing speeds, Bisimilarity of open terms., Decoding choice encodings, Vertical implementation, Simulation preorder over simple process algebras, The box algebra = Petri nets + process expressions, Ordered SOS process languages for branching and eager bisimulations, On the expressiveness of choice quantification, Axiomatizing GSOS with termination, Rule formats for compositional non-interference properties, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Branching time and orthogonal bisimulation equivalence, Precise interprocedural dependence analysis of parallel programs, Shuffle on positive varieties of languages, Discrete time process algebra, Categorical shape theory as a formal language for pattern recognition?, Timing and causality in process algebra, A specification structure for deadlock-freedom of synchronous processes, Models of nondeterministic regular expressions, Rooted branching bisimulation as a congruence, Refinement-oriented probability for CSP, Computable processes and bisimulation equivalence, Continuity controlled hybrid automata, Linearization of hybrid processes, Syntax and consistent equation semantics of hybrid Chi, Non-bisimulation-based Markovian behavioral equivalences, Operational semantics for Petri net components, Denotational semantics for thread algebra, Symmetric electoral systems for ambient calculi, Simulating Turing machines on Maurer machines, On the expressiveness of higher dimensional automata, Branching bisimulation for probabilistic systems: characteristics and decidability, Bisimulations and predicate logic, Network algebra for asynchronous dataflow∗, Automating the refinement of specifications for distributed systems via syntactic transformations, Strong types for coordinating active objects, Maurer computers for pipelined instruction processing, Bochvar-McCarthy logic and process algebra, Deciding bisimulation-like equivalences with finite-state processes, Inheritance of behavior, Real time process algebra with time-dependent conditions, Linearization in parallel pCRL, Inheritance of workflows: An approach to tackling problems related to change, Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, The regular viewpoint on PA-processes, Non-regular iterators in process algebra, The parallel composition of uniform processes with data, Distributed processes and location failures, Splitting bisimulations and retrospective conditions, Hierarchical control of discrete-event systems, Synchronized shuffles, Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal, A theory of stochastic systems. II: Process algebra, Decidable first-order transition logics for PA-processes, Axiomatising divergence, Reversing algebraic process calculi, Algebra of timed frames, A Context-Free Process as a Pushdown Automaton, A Rule Format for Associativity, On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems, PRISMA: A Mobile Calculus with Parametric Synchronization
