Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Semi-composition"'
Publikováno v:
Acta Informatica
Acta Informatica, Springer Verlag, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
Acta Informatica, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
Acta Informatica, Springer Verlag, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
Acta Informatica, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
International audience; During the last decades, concurrency theory successfully developed salient concepts to formally model and soundly reason about distributed and parallel systems. In practice, however, most attempts at analyzing large systems fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87caf61326f9cc77b90b04ff9cd97b24
https://hal.inria.fr/hal-01247507
https://hal.inria.fr/hal-01247507
Publikováno v:
[Research Report] RR-8708, INRIA Grenoble-Rhône-Alpes. 2015
During the last decades, concurrency theory successfully developed salient concepts to formally model and soundly reason about distributed and parallel systems. In practice, however, most attempts at analyzing large systems face severe complexity iss
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4b024fd3f6ee54d36002a13b8635db1a
https://hal.inria.fr/hal-01138749/document
https://hal.inria.fr/hal-01138749/document
Autor:
JARADAT, M. M. M., RAWASHDEH, E. A.
Publikováno v:
Volume: 29, Issue: 4 349-364
Turkish Journal of Mathematics
Turkish Journal of Mathematics
The basis number of a graph G is defined to be the least integer d such that there is a basis \mathcal{B} of the cycle space of G such that each edge of G is contained in at most d members of \mathcal{B}. We investigate the basis number of the semi-c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=tubitakulakb::4f99314b42805cd75377165edae849d7
https://dergipark.org.tr/tr/pub/tbtkmath/issue/12243/146099
https://dergipark.org.tr/tr/pub/tbtkmath/issue/12243/146099
Autor:
Lang, Frederic
Publikováno v:
[Research Report] RR-5996, INRIA. 2006, pp.22
The compositional verification approach of Graf & Steffen aims at avoiding state space explosion for individual processes of a concurrent system. It relies on interfaces that express the behavioural constraints imposed on each process by synchronizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::771d6088e296b1cc5dddb1dca578a695
https://hal.inria.fr/inria-00106312v2/file/RR-5996.pdf
https://hal.inria.fr/inria-00106312v2/file/RR-5996.pdf
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.