All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00049649" target="_blank" >RIV/00216224:14330/11:00049649 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.scico.2010.02.008" target="_blank" >http://dx.doi.org/10.1016/j.scico.2010.02.008</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.scico.2010.02.008" target="_blank" >10.1016/j.scico.2010.02.008</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata

  • Original language description

    Software systems assembled from autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL (Chaki et al. 2004, 2005) incorporates both states and events to express important properties of component-based software systems. The main contribution of this paper is a partial order reduction technique for verification of state/event LTL properties. The core is a novel notion of stuttering equivalence. The positiveattribute of the equivalence is that it can be resolved with existing methods for partial order reduction. State/event LTL properties are, in general, not preserved under state/event stuttering equivalence. To this end we define a new logic, called weakstate/event LTL, which is invariant under the new equivalence.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F09%2F1389" target="_blank" >GA201/09/1389: Verification and Analysis of Large-Scale Computer Systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2011

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Science of Computer Programming

  • ISSN

    0167-6423

  • e-ISSN

  • Volume of the periodical

    76

  • Issue of the periodical within the volume

    10

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    14

  • Pages from-to

    877-890

  • UT code for WoS article

    000292232900004

  • EID of the result in the Scopus database