Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BYCC-BY - Uznanie autorstwa
 

Reachability for Bounded Branching VASS

Uproszczony widok
dc.affiliationUniwersytet Warszawski
dc.conference.countryHolandia
dc.conference.datefinish2019-08-31
dc.conference.datestart2019-08-26
dc.conference.placeAmsterdam
dc.conference.seriesInternational Conference on Concurrency Theory
dc.conference.seriesInternational Conference on Concurrency Theory
dc.conference.seriesshortcutCONCUR
dc.conference.shortcutCONCUR 2019
dc.conference.weblinkhttps://event.cwi.nl/concur2019/
dc.contributor.authorPilipczuk, Michał
dc.contributor.authorMazowiecki, Filip
dc.date.accessioned2024-01-25T18:46:58Z
dc.date.available2024-01-25T18:46:58Z
dc.date.copyright2019-08-20
dc.date.issued2019
dc.description.accesstimeAT_PUBLICATION
dc.description.financeNie dotyczy
dc.description.versionFINAL_PUBLISHED
dc.description.volume140
dc.identifier.doi10.4230/LIPICS.CONCUR.2019.28
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/117894
dc.identifier.weblinkhttps://drops.dagstuhl.de/opus/volltexte/2019/10930/
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages28:1--28:13
dc.rightsCC-BY
dc.sciencecloudnosend
dc.subject.enBranching VASS
dc.subject.encounter machines
dc.subject.enreachability problem
dc.subject.enbobrvass
dc.titleReachability for Bounded Branching VASS
dc.typeJournalArticle
dspace.entity.typePublication