Modal Transition Systems with Weight Intervals

J 2012

Modal Transition Systems with Weight Intervals

JUHL, Line; Kim G. LARSEN a Jiří SRBA

Základní údaje

Originální název

Modal Transition Systems with Weight Intervals

Autoři

JUHL, Line; Kim G. LARSEN a Jiří SRBA

Vydání

Journal of Logic and Algebraic Programming, 2012, 1567-8326

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Nizozemské království

Utajení

není předmětem státního či obchodního tajemství

Odkazy

Web

Impakt faktor

Impact factor: 0.529

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/12:00062434

Organizační jednotka

Fakulta informatiky

DOI

https://doi.org/10.1016/j.jlap.2012.03.008

UT WoS

000304490400004

Klíčová slova anglicky

modal transition systems; multiweighted extension; components

Změněno: 23. 4. 2013 12:27, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

We propose weighted modal transition systems, an extension to the well-studied specification formalism of modal transition systems that allows to express both required and optional behaviours of their intended implementations. In our extension we decorate each transition with a weight interval that indicates the range of concrete weight values available to the potential implementations. In this way resource constraints can be modelled using the modal approach. We focus on two problems. First, we study the question of existence/finding the largest common refinement for a number of finite deterministic specifications and we show PSPACE-completeness of this problem. By constructing the most general common refinement, we allow for a stepwise and iterative construction of a common implementation. Second, we study a logical characterisation of the formalism and show that a formula in a natural weight extension of the logic CTL is satisfied by a given modal specification if and only if it is satisfied by all its refinements. The weight extension is general enough to express different sorts of properties that we want our weights to satisfy.

Návaznosti

LA09016, projekt VaV

Název: Účast ČR v European Research Consortium for Informatics and Mathematics (ERCIM) (Akronym: ERCIM)

Investor: Ministerstvo školství, mládeže a tělovýchovy ČR, Účast ČR v European Research Consortium for Informatics and Mathematics

Citovat

JUHL, Line; Kim G. LARSEN a Jiří SRBA. Modal Transition Systems with Weight Intervals. Journal of Logic and Algebraic Programming. 2012, roč. 81, č. 4, s. 408-421. ISSN 1567-8326. Dostupné z: https://doi.org/10.1016/j.jlap.2012.03.008.

@article{1079135,
   author = {Juhl, Line and Larsen, Kim G. and Srba, Jiří},
   article_number = {4},
   doi = {https://doi.org/10.1016/j.jlap.2012.03.008},
   keywords = {modal transition systems; multiweighted extension; components},
   language = {eng},
   issn = {1567-8326},
   journal = {Journal of Logic and Algebraic Programming},
   title = {Modal Transition Systems with Weight Intervals},
   url = {http://dx.doi.org/10.1016/j.jlap.2012.03.008},
   volume = {81},
   year = {2012}
}

TY  - JOUR
ID  - 1079135
AU  - Juhl, Line - Larsen, Kim G. - Srba, Jiří
PY  - 2012
TI  - Modal Transition Systems with Weight Intervals
JF  - Journal of Logic and Algebraic Programming
VL  - 81
IS  - 4
SP  - 408-421
EP  - 408-421
SN  - 15678326
KW  - modal transition systems
KW  - multiweighted extension
KW  - components
UR  - http://dx.doi.org/10.1016/j.jlap.2012.03.008
L2  - http://dx.doi.org/10.1016/j.jlap.2012.03.008
N2  - We propose weighted modal transition systems, an extension to the well-studied specification formalism of modal transition systems that allows to express both required and optional behaviours of their intended implementations. In our extension we decorate each transition with a weight interval that indicates the range of concrete weight values available to the potential implementations. In this way resource constraints can be modelled using the modal approach. We focus on two problems. First, we study the question of existence/finding the largest common refinement for a number of finite deterministic specifications and we show PSPACE-completeness of this problem. By constructing the most general common refinement, we allow for a stepwise and iterative construction of a common implementation. Second, we study a logical characterisation of the formalism and show that a formula in a natural weight extension of the logic CTL is satisfied by a given modal specification if and only if it is satisfied by all its refinements. The weight extension is general enough to express different sorts of properties that we want our weights to satisfy.
ER  -

JUHL, Line; Kim G. LARSEN a Jiří SRBA. Modal Transition Systems with Weight Intervals. \textit{Journal of Logic and Algebraic Programming}. 2012, roč.~81, č.~4, s.~408-421. ISSN~1567-8326. Dostupné z: https://doi.org/10.1016/j.jlap.2012.03.008.

Přehled o publikaci