Probabilistic model of software approximate correctness
DOI10.1007/S11859-016-1137-XzbMATH Open1363.68039OpenAlexW2326316958MaRDI QIDQ2825263FDOQ2825263
Authors: Yanfang Ma, Liang Chen 
Publication date: 6 October 2016
Published in: Wuhan University Journal of Natural Sciences (WUJNS) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-016-1137-x
Recommendations
- Quantitative analysis of software approximate correctness
- The infinite evolution mechanism of \(\epsilon\)-bisimilarity
- scientific article; zbMATH DE number 1696897
- The approximate correctness of systems based on \(\delta\)-bisimulation
- Compositionality of approximate bisimulation for probabilistic systems
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Calculi for synchrony and asynchrony
- Bisimulation through probabilistic testing
- Title not available (Why is that?)
- Approximation Metrics for Discrete and Continuous Systems
- Communicating sequential processes
- Reactive, generative, and stratified models of probabilistic processes
- Bisimulation indexes and their applications
- The origins of structural operational semantics
- Testing Finitary Probabilistic Processes
- Additive models of probabilistic processes
- The infinite evolution mechanism of \(\epsilon\)-bisimilarity
- Simulation for lattice-valued doubly labeled transition systems
- The quantitative linear-time-branching-time spectrum
Cited In (4)
This page was built for publication: Probabilistic model of software approximate correctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2825263)
