The approximate correctness of systems based on \(\delta\)-bisimulation

DOI10.1016/J.ENTCS.2017.08.007zbMath1392.68309OpenAlexW2760372412WikidataQ113317586 ScholiaQ113317586MaRDI QIDQ1744456

Haiyu Pan, Yan-Fang Ma

Publication date: 23 April 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2017.08.007

zbMATH Keywords

correctnesscomplete latticefuzzy systembisimulationlimit

Mathematics Subject Classification ID

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

Related Items (1)

Limited approximate bisimulations and the corresponding rough approximations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The infinite evolution mechanism of \(\epsilon\)-bisimilarity
• Lattice-valued simulations for quantitative transition systems
• On metrics for probabilistic systems: definitions and algorithms
• Bisimulation indexes and their applications
• Simulation for lattice-valued doubly labeled transition systems
• The quantitative linear-time-branching-time spectrum
• Topological Construction of Parameterized Bisimulation Limit
• Quantitative Analysis of Lattice-valued Kripke Structures
• Formal Modeling and Analysis of Timed Systems
• CONCUR 2003 - Concurrency Theory

This page was built for publication: The approximate correctness of systems based on \(\delta\)-bisimulation