scientific article

zbMath1035.68069MaRDI QIDQ2760254

Jan Friso Groote, Michel Reniers

Publication date: 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

process algebratree identify protocolline interface protocol

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (22)

On the expressiveness of choice quantification ⋮ On process equivalence = equation solving in CCS ⋮ Axiomatizing recursion-free, regular monitors ⋮ Focus points and convergent process operators: A proof strategy for protocol verification ⋮ Cones and foci: A mechanical framework for protocol verification ⋮ Generalizing DPLL and satisfiability for equalities ⋮ Model checking a cache coherence protocol of a Java DSM implementation ⋮ A Context-Free Process as a Pushdown Automaton ⋮ Hybrid process algebra ⋮ Dynamic consistency in process algebra: from paradigm to ACP ⋮ Dynamic Consistency in Process Algebra: From Paradigm to ACP ⋮ A brief history of process algebra ⋮ Five Determinisation Algorithms ⋮ A Framework for Automatically Checking Anonymity with μCRL ⋮ Refined Interfaces for Compositional Verification ⋮ Multiparty Contract Signing Over a Reliable Network ⋮ Parameterised Boolean equation systems ⋮ Relating Hybrid Chi to Other Formalisms ⋮ From μCRL to mCRL2 ⋮ Discretization of Timed Automata in Timed μCRL à la Regions and Zones ⋮ Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi ⋮ Process-algebraic approaches for multi-agent systems: an overview

This page was built for publication: