scientific article; zbMATH DE number 7327941

MaRDI QIDQ5856411

Jan Friso Groote, Maurice Laveaux, Tim A. C. Willemse

Publication date: 26 March 2021

Full work available at URL: https://arxiv.org/abs/1902.09880

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

zbMATH Keywords

algorithmsbenchmarksantichainsrefinement checking

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Correct and efficient antichain algorithms for refinement checking

Uses Software

• FDR3
• Antichains

Cites Work

• Unnamed Item
• Unnamed Item
• Computing maximal weak and other bisimulations
• CCS expressions, finite state processes, and three problems of equivalence
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• A branching time model of CSP
• Understanding concurrent systems
• Branching Bisimilarity with Explicit Divergence
• Antichain Algorithms for Finite Automata
• Three Partition Refinement Algorithms
• Branching time and abstraction in bisimulation semantics
• An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
• FDR3 — A Modern Refinement Checker for CSP
• Antichains: A New Algorithm for Checking Universality of Finite Automata

This page was built for publication: