Handbook of process algebra
From MaRDI portal
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Cited in
(95)- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
- Towards general axiomatizations for bisimilarity and trace semantics
- Process algebra and model checking
- Unguarded recursion on coinductive resumptions
- Modelling Divergence in Relational Concurrent Refinement
- The how and why of interactive Markov chains
- Special issue: Process algebra
- Metrics for weighted transition systems: axiomatization and complexity
- Bisimulation on speed: a unified approach
- CSP-CASL -- a new integration of process algebra and algebraic specification
- scientific article; zbMATH DE number 7471704 (Why is no real title available?)
- Dynamic consistency in process algebra: from paradigm to ACP
- A behavioural theory of recursive algorithms
- Equivalence Checking for a Finite Higher Order π-Calculus
- Conjunction on processes: Full abstraction via ready-tree semantics
- Divergence and unique solution of equations
- Ready simulation for concurrency: it's logical!
- An algebraic theory of nondeterministic finite automata
- Unguarded recursion on coinductive resumptions
- Back to the format: a survey on SOS for probabilistic processes
- Bisimilar and logically equivalent programs in PDL
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B
- Attributed transition systems with hidden transitions
- The origins of structural operational semantics
- Bisimulation on speed: Lower time bounds
- Measuring the confinement of probabilistic systems
- Fifty years of Hoare's logic
- Analysis of the structure of attributed transition systems without hidden transitions
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Tempus fugit: How to plug it
- What is a free name in a process algebra?
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Bisimulation on speed: Worst-case efficiency
- Bisimilar and logically equivalent programs in PDL with parallel operator
- Computation as social agency: what, how and who
- Systems specification by basic protocols
- Non-bisimulation-based Markovian behavioral equivalences
- Unifying guarded and unguarded iteration
- Relational concurrent refinement. III: Traces, partial relations and automata
- Generating models of infinite-state communication protocols using regular inference with abstraction
- A new game equivalence, its logic and algebra
- Infinite unfair shuffles and associativity
- Process algebras for systems diagnosis.
- Relational concurrent refinement: automata
- Concurrent weighted logic
- Probabilistic temporal logics via the modal mu-calculus
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- Mathematical modal logic: A view of its evolution
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Representing guardedness in call-by-value and guarded parametrized monads
- A formalization of anonymity and onion routing
- Synchronized shuffles
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
- A metalanguage for guarded iteration
- A brief history of process algebra
- On the usability of process algebra: An architectural view
- Priority and abstraction in process algebra
- Towards a process calculus for REST: current state of the art
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- Algebraic-coalgebraic specification in CoCASL
- scientific article; zbMATH DE number 7080198 (Why is no real title available?)
- Final coalgebras and the Hennessy-Milner property
- On linear logic planning and concurrency
- Compositional verification of asynchronous concurrent systems using CADP
- Team bisimilarity, and its associated modal logic, for BPP nets
- More relational concurrent refinement: traces and partial relations
- Transactional Reduction of Component Compositions
- Processes, systems \& tests: defining contextual equivalences
- Taking decisions late: end-based choice combined with action refinement
- Behavioural equivalences of a probabilistic pi-calculus
- Free decomposition spaces
- Arithmetical datatypes with true fractions
- Modelling simultaneous games in dynamic logic
- Dynamic consistency in process algebra: from paradigm to ACP
- Ultraproducts and possible worlds semantics in institutions
- A logical process calculus
- On the axiomatisability of priority. III: Priority strikes again
- Uncertainty representation in dynamical systems using rough set theory
- Decidable Extensions of Hennessy-Milner Logic
- FSP and FLTL framework for specification and verification of middle-agents
- Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B
- Choice trees: representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
- Fractals from regular behaviours
- A Complete Axiomatic System for a Process-Based Spatial Logic
- On probabilistic techniques for data flow analysis
- Algebraic theory of probabilistic processes.
- Safe reasoning with logic LTS
- A new game equivalence and its modal logic
- Process-algebraic approaches for multi-agent systems: an overview
- A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence
- Processes against tests: on defining contextual equivalences
- scientific article; zbMATH DE number 7559474 (Why is no real title available?)
- Tracking information
This page was built for publication: Handbook of process algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746874)
