A complete approximation theory for weighted transition systems

DOI10.1007/978-3-319-47677-3_14MaRDI QIDQ1660779zbMATH OpenOpenAlexFDO

Authors Mikkel Hansen, Radu Mardare, Bingtian Xue, Kim G. Larsen, Mathias Ruggaard Pedersen

Publication date 16 August 2018

Full work available at URL https://strathprints.strath.ac.uk/70266/

Mathematics Subject Classification ID

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

Recommendations

• Complete proof systems for weighted modal logic
• Metrics for weighted transition systems: axiomatization and complexity
• Alternation-free weighted mu-calculus: decidability and completeness
• A complete axiomatization of weighted branching bisimulation
• Quantitative analysis of weighted transition systems

Cited in

(6)

• Approximate weighted model integration on DNF structures
• An approximation algorithm for box abstraction of transition systems on real state spaces
• Decidability and expressiveness of recursive weighted logic
• Modal transition systems with weight intervals
• Reasoning about bounds in weighted transition systems
• Alternation-free weighted mu-calculus: decidability and completeness

This page was built for publication: A complete approximation theory for weighted transition systems

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