scispace - formally typeset
Proceedings ArticleDOI

A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata

Reads0
Chats0
TLDR
A simple fragment of CTL is proposed that is able to express properties about accumulated weights along maximal runs of multiweighted modal automata by equipped with a game-based semantics and guaranteeing both soundness and completeness.
Abstract
Multiweighted modal automata provide a specification theory for multiweighted transition systems that have recently attracted interest in the context of energy games. We propose a simple fragment of CTL that is able to express properties about accumulated weights along maximal runs of multiweighted modal automata. Our logic is equipped with a game-based semantics and guarantees both soundness (formula satisfaction is propagated to the modal refinements) as well as completeness (formula non-satisfaction is propagated to at least one of its implementations). We augment our theory with a summary of decidability and complexity results of the generalized model checking problem, asking whether a specification -- abstracting the whole set of its implementations -- satisfies a given formula.

read more

Citations
More filters
Proceedings ArticleDOI

Trade-off analysis meets probabilistic model checking

TL;DR: This paper presents the concepts of quantiles, conditional probabilities and expectations as well as objectives on the ratio between accumulated costs and utility, and extends the results towards combined quantile queries, computing conditional probabilities those conditions are expressed as formulas in probabilistic computation tree logic, and the computation of ratios.
Book ChapterDOI

30 Years of Modal Transition Systems: Survey of Extensions and Analysis

TL;DR: The specification formalism of modal transition systems (MTS) is surveyed, various extensions of MTS, their relationships and modelling capabilities are discussed, and problems arising in verification and analysis of these systems are discussed.
Journal ArticleDOI

General quantitative specification theories with modal transition systems

TL;DR: This paper proposes a new theory of quantitative specifications that generalizes the notions of step-wise refinement and compositional design operations from the Boolean to an arbitrary quantitative setting.
Journal ArticleDOI

Multi-weighted Automata and MSO Logic

TL;DR: A general model for multi-weighted automata as well as a multi- Weighted MSO logic that is expressively equivalent both for finite and infinite words and the translation process is effective, leading to decidability results.
Book ChapterDOI

Multi-weighted Automata and MSO Logic

TL;DR: In this article, the authors introduce a general model for multi-weighted automata as well as a multiweighted MSO logic, which is expressively equivalent both for finite and infinite words.
References
More filters
BookDOI

Handbook of Weighted Automata

TL;DR: This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications, and presents a detailed survey of the state of the art and pointers to future research.
Proceedings ArticleDOI

A modal process logic

TL;DR: A novel logic is introduced for the introduction of nondeterministic and concurrent processes expressed in a process algebra that is an extension of process algebra in the sense that process constructs are included as connectives in the logic.
Journal ArticleDOI

Weighted automata and weighted logics

TL;DR: A weighted version of MSO logic is introduced and it is proved that, for commutative semirings, the behaviours of weighted automata are precisely the formal power series definable with particular sentences of the authors' weighted logic.