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”

CAAL: Concurrency Workbench, Aalborg Edition

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00087229" target="_blank" >RIV/00216224:14330/15:00087229 - isvavai.cz</a>

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007%2F978-3-319-25150-9_33" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-25150-9_33</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-25150-9_33" target="_blank" >10.1007/978-3-319-25150-9_33</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    CAAL: Concurrency Workbench, Aalborg Edition

  • Original language description

    We present the first official release of CAAL, a web-based tool for modelling and verification of concurrent processes. The tool is primarily designed for educational purposes and it supports the classical process algebra CCS together with its timed extension TCCS. It allows to compare processes with respect to a range of strong/weak and timed/untimed equivalences and preorders (bisimulation, simulation and traces) and supports model checking of CCS/TCCS processes against recursively defined formulae ofHennessy-Milner logic. The tool offers a graphical visualizer for displaying labelled transition systems, including their minimization up to strong/weak bisimulation, and process behaviour can be examined by playing (bi)simulation and model checking games or via the generation of distinguishing formulae for non-equivalent processes. We describe the modelling and analysis features of CAAL, discuss the underlying verification algorithms and show a typical example of a use in the classroom

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • 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

  • Article name in the collection

    Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC'15)

  • ISBN

    9783319251493

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    573-582

  • Publisher name

    Springer

  • Place of publication

    Netherlands

  • Event location

    Cali, Colombia

  • Event date

    Jan 1, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000366212700033