Bisimulation verification using the up to techniques

DOI10.1007/S100090100041MaRDI QIDQ5953448zbMATH OpenOpenAlexWikidataFDO

Authors Daniel Hirschkoff

Publication date 23 January 2002

Published in International Journal on Software Tools for Technology Transfer. STTT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s100090100041

zbMATH Keywords

\(\pi\)-calculusbisimulation verification algorithm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automata, Languages and Programming
• Beyond Bisimulation: The “up-to” Techniques
• New up-to techniques for weak bisimulation
• Bisimulations up-to: beyond first-order transition systems
• Coalgebraic bisimulation-up-to

Cited in

(5)

• Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
• scientific article; zbMATH DE number 4022620 (Why is no real title available?)
• Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
• From bounded checking to verification of equivalence via symbolic up-to techniques
• Graded monads and behavioural equivalence games

Describes a project that uses

Uses Software

• MWB
• Pict

This page was built for publication: Bisimulation verification using the up to techniques

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