A Logic for Accumulated-Weight Reasoning on Multiweighted Modal 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.

[1]  Axel Legay,et al.  A Modal Interface Theory for Component-based Design , 2011, Fundam. Informaticae.

[2]  Benedikt Bollig,et al.  Weighted versus Probabilistic Logics , 2009, Developments in Language Theory.

[3]  Kim G. Larsen,et al.  Modal transition systems with weight intervals , 2012, J. Log. Algebraic Methods Program..

[4]  Antonín Kucera,et al.  On the Controller Synthesis for Finite-State Markov Decision Processes , 2005, Fundam. Informaticae.

[5]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[6]  Orna Kupferman,et al.  Lattice Automata , 2007, VMCAI.

[7]  Patrice Godefroid,et al.  LTL generalized model checking revisited , 2010, International Journal on Software Tools for Technology Transfer.

[8]  Manfred Droste,et al.  Describing Average- and Longtime-Behavior by Weighted MSO Logics , 2010, MFCS.

[9]  Marsha Chechik,et al.  Mixed Transition Systems Revisited , 2008, VMCAI.

[10]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[11]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[12]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[13]  Kim G. Larsen,et al.  Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete , 2009, ICTAC.

[14]  Kim G. Larsen,et al.  On determinism in modal transition systems , 2009, Theor. Comput. Sci..

[15]  Marsha Chechik,et al.  How Thorough Is Thorough Enough? , 2005, CHARME.

[16]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[17]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[18]  Krishnendu Chatterjee,et al.  Temporal Specifications with Accumulative Values , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[19]  Patrice Godefroid,et al.  Generalized Model Checking: Reasoning about Partial State Spaces , 2000, CONCUR.

[20]  Radha Jagadeesan,et al.  Abstraction-Based Model Checking Using Modal Transition Systems , 2001, CONCUR.

[21]  Kim G. Larsen,et al.  Energy Games in Multiweighted Automata , 2011, ICTAC.