Long-run cost analysis by approximation of linear operators over dioids

DOI10.1017/S0960129510000113zbMath1209.68124OpenAlexW2059210609MaRDI QIDQ3583023

No author found.

Publication date: 26 August 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129510000113

zbMATH Keywords

quantitative behaviour of programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Cost analysis of object-oriented bytecode programs

Cites Work

• Unnamed Item
• Measuring the confinement of probabilistic systems
• Graphs, dioids and semirings. New models and algorithms.
• A program logic for resources
• Probabilistic  -calculus and Quantitative Program Analysis
• ENDOMORPHISMS OF SEMIMODULES OVER SEMIRINGS WITH AN IDEMPOTENT OPERATION
• Semiring-based constraint satisfaction and optimization

This page was built for publication: Long-run cost analysis by approximation of linear operators over dioids