2012 · 11 citations · 8 references
ComputingComputer ScienceFormal MethodsGame TheoryTheory Of ComputationAutomata TheoryFinite-state MachinesModal LogicModal SemanticsModel CheckingVerificationComplexityFinite-state VerificationGame-theoretic SemanticsModel Checking SpecificationsState Transition SystemsTransition SystemsWeighted AutomataWeighted Finite-state Automata
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.
8
Computation: Finite and Infinite Machines.
D. A. Clarke, Marvin Minsky · American Mathematical Monthly · 1968 · 2.6K citations
Kim G. Larsen, Bent Thomsen · 2003 · 469 citations
Weighted automata and weighted logics
Manfred Droste, Paul Gastin · Theoretical Computer Science · 2007 · 224 citations
A Modal Interface Theory for Component-based Design
Jean-Baptiste Raclet, Éric Badouel, Albert Benveniste et al. · Fundamenta Informaticae · 2011 · 99 citations · Full text
Computing, Computer Science, Design +15
Temporal Specifications with Accumulative Values
Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger et al. · 2011 · 61 citations · Full text