Computing bisimulation-based comparisons

DOI10.3233/FI-2018-1634MaRDI QIDQ4637906zbMATH OpenOpenAlexFDO

Authors Linh Anh Nguyen

Publication date 3 May 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2018-1634

Mathematics Subject Classification ID

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

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• An efficient algorithm for computing bisimulation equivalence
• scientific article; zbMATH DE number 6970796
• From bisimulation to simulation: Coarsest partition problems
• Rank and simulation: the well-founded case

Cited in

(5)

• Computing crisp bisimulations for fuzzy structures
• An Incremental Bisimulation Algorithm
• Theory of Cryptography
• Tools and Algorithms for the Construction and Analysis of Systems
• Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis

This page was built for publication: Computing bisimulation-based comparisons

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