Partial order reduction for reachability games

Frederik Meyer Bønneland; Peter Gjøl Jensen; Kim G. Larsen; Marco Muñiz; Jiří Srba

doi:10.4230/LIPIcs.CONCUR.2019.23

Partial order reduction for reachability games

Frederik Meyer Bønneland, Peter Gjøl Jensen, Kim G. Larsen, Marco Muñiz, Jiří Srba

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

5 Citationer (Scopus)

32 Downloads (Pure)

Originalsprog	Engelsk
Titel	30th International Conference on Concurrency Theory, CONCUR 2019
Redaktører	Wan Fokkink, Rob van Glabbeek
Forlag	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publikationsdato	aug. 2019
Artikelnummer	23
ISBN (Elektronisk)	9783959771214
DOI	https://doi.org/10.4230/LIPIcs.CONCUR.2019.23
Status	Udgivet - aug. 2019
Begivenhed	30th International Conference on Concurrency Theory, CONCUR 2019 - Amsterdam, Holland Varighed: 27 aug. 2019 → 30 aug. 2019

Konference

Konference	30th International Conference on Concurrency Theory, CONCUR 2019
Land/Område	Holland
By	Amsterdam
Periode	27/08/2019 → 30/08/2019

Navn	Leibniz International Proceedings in Informatics, LIPIcs
Vol/bind	140
ISSN	1868-8969

Adgang til dokumentet

10.4230/LIPIcs.CONCUR.2019.23Licens: CC BY 3.0

LIPIcs-CONCUR-2019-23Forlagets udgivne version, 565 KBLicens: CC BY 3.0

Andre filer og links

http://www.scopus.com/inward/record.url?scp=85071623163&partnerID=8YFLogxK

5 Citationer
1 Ph.d.-afhandling

Time For Stubborn Game Reductions
Bønneland, F. M., 2021, Aalborg Universitetsforlag. 165 s. (Ph.d.-serien for Det Tekniske Fakultet for IT og Design, Aalborg Universitet).
Publikation: Bog/antologi/afhandling/rapport › Ph.d.-afhandling › Forskning

Åben adgang
Fil

Citationsformater

Bønneland, F. M., Jensen, P. G., Larsen, K. G., Muñiz, M., & Srba, J. (2019). Partial order reduction for reachability games. I W. Fokkink, & R. van Glabbeek (red.), 30th International Conference on Concurrency Theory, CONCUR 2019 [23] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 140 https://doi.org/10.4230/LIPIcs.CONCUR.2019.23

Bønneland, Frederik Meyer ; Jensen, Peter Gjøl ; Larsen, Kim G. ; Muñiz, Marco ; Srba, Jiří. / Partial order reduction for reachability games. 30th International Conference on Concurrency Theory, CONCUR 2019. red. / Wan Fokkink ; Rob van Glabbeek. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 140).

@inproceedings{b5befff1df774f8f8135de7ee0eb129a,

title = "Partial order reduction for reachability games",

keywords = "Games, Partial order reduction, Petri nets, Stubborn sets, Synthesis",

author = "B{\o}nneland, {Frederik Meyer} and Jensen, {Peter Gj{\o}l} and Larsen, {Kim G.} and Marco Mu{\~n}iz and Ji{\v r}{\'i} Srba",

year = "2019",

month = aug,

doi = "10.4230/LIPIcs.CONCUR.2019.23",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Wan Fokkink and {van Glabbeek}, Rob",

booktitle = "30th International Conference on Concurrency Theory, CONCUR 2019",

note = "30th International Conference on Concurrency Theory, CONCUR 2019 ; Conference date: 27-08-2019 Through 30-08-2019",

}

Bønneland, FM , Jensen, PG , Larsen, KG , Muñiz, M & Srba, J 2019, Partial order reduction for reachability games. i W Fokkink & R van Glabbeek (red), 30th International Conference on Concurrency Theory, CONCUR 2019., 23, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, bind 140, 30th International Conference on Concurrency Theory, CONCUR 2019, Amsterdam, Holland, 27/08/2019. https://doi.org/10.4230/LIPIcs.CONCUR.2019.23

Partial order reduction for reachability games. / Bønneland, Frederik Meyer ; Jensen, Peter Gjøl ; Larsen, Kim G.; Muñiz, Marco ; Srba, Jiří.

30th International Conference on Concurrency Theory, CONCUR 2019. red. / Wan Fokkink; Rob van Glabbeek. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 23 (Leibniz International Proceedings in Informatics, LIPIcs, Bind 140).

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

TY - GEN

T1 - Partial order reduction for reachability games

AU - Bønneland, Frederik Meyer

AU - Jensen, Peter Gjøl

AU - Larsen, Kim G.

AU - Muñiz, Marco

AU - Srba, Jiří

PY - 2019/8

Y1 - 2019/8

KW - Games

KW - Partial order reduction

KW - Petri nets

KW - Stubborn sets

KW - Synthesis

UR - http://www.scopus.com/inward/record.url?scp=85071623163&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.CONCUR.2019.23

DO - 10.4230/LIPIcs.CONCUR.2019.23

M3 - Article in proceeding

AN - SCOPUS:85071623163

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 30th International Conference on Concurrency Theory, CONCUR 2019

A2 - Fokkink, Wan

A2 - van Glabbeek, Rob

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 30th International Conference on Concurrency Theory, CONCUR 2019

Y2 - 27 August 2019 through 30 August 2019

ER -

Bønneland FM , Jensen PG , Larsen KG , Muñiz M , Srba J. Partial order reduction for reachability games. I Fokkink W, van Glabbeek R, red., 30th International Conference on Concurrency Theory, CONCUR 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 23. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 140). https://doi.org/10.4230/LIPIcs.CONCUR.2019.23

Partial order reduction for reachability games

Konference

Adgang til dokumentet

Andre filer og links

Fingeraftryk

Publikation

Time For Stubborn Game Reductions

Citationsformater