Quantitative \(\mu\)-calculus and CTL defined over constraint semirings

DOI10.1016/j.tcs.2005.08.006zbMath1080.68065OpenAlexW1964764902WikidataQ56501923 ScholiaQ56501923MaRDI QIDQ2576952

Ugo Montanari, Alberto Lluch Lafuente

Publication date: 29 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.08.006

zbMATH Keywords

QoSsemiringstemporal logicsquantitative model checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

Unnamed Item ⋮ There are Two Sides to Every Question ⋮ Model checking computation tree logic over finite lattices ⋮ Quantitative model checking of linear-time properties based on generalized possibility measures ⋮ Modal transition systems with weight intervals ⋮ Unnamed Item ⋮ Quantitative analysis of weighted transition systems ⋮ Co-Algebraic Models for Quantitative Spatial Logics

Cites Work

• Data structures for symbolic multi-valued model-checking
• A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
• A logic for reasoning about time and reliability
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• A lattice-theoretical fixpoint theorem and its applications
• Semiring-based constraint satisfaction and optimization
• Handbook of Graph Grammars and Computing by Graph Transformation
• Verification: Theory and Practice
• Tools and Algorithms for the Construction and Analysis of Systems
• Soft constraint logic programming and generalized shortest path problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantitative \(\mu\)-calculus and CTL defined over constraint semirings