Quantitative analysis of software approximate correctness

DOI10.1155/2015/173012zbMath1394.68077OpenAlexW1553079932WikidataQ59117468 ScholiaQ59117468MaRDI QIDQ1664851

Yan-Fang Ma

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/173012

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
• Two-thirds simulation indexes and modal logic characterization
• Metrics for weighted transition systems: axiomatization and complexity
• Calculi for synchrony and asynchrony
• Bisimulation through probabilistic testing
• Bisimulation indexes and their applications
• Additive models of probabilistic processes
• Reactive, generative, and stratified models of probabilistic processes
• Simulation for lattice-valued doubly labeled transition systems
• The quantitative linear-time-branching-time spectrum
• Topological Construction of Parameterized Bisimulation Limit
• Testing Finitary Probabilistic Processes
• Quantitative Analysis of Lattice-valued Kripke Structures
• Approximation Metrics for Discrete and Continuous Systems

This page was built for publication: Quantitative analysis of software approximate correctness