A Fully Symbolic Bisimulation Algorithm

DOI10.1007/978-3-642-24288-5_19zbMATH Open1348.68166OpenAlexW100098803MaRDI QIDQ3172876FDOQ3172876

Gianfranco Ciardo, Malcolm Mumme

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24288-5_19

zbMATH Keywords

verificationsaturationbisimulationlocalitydecision diagramssymbolic methods

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Two-layer symbolic representation for stochastic models with phase-type distributed events
• A complete symbolic bisimulation for full applied pi calculus

This page was built for publication: A Fully Symbolic Bisimulation Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172876)