Остановите войну!
for scientists:
default search action
Patricia Bouyer
- > Home > Persons > Patricia Bouyer
Publications
- 2023
- [i36]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023) - 2021
- [j36]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. Log. Methods Comput. Sci. 17(1) (2021) - 2020
- [c96]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Synthesizing Safe Coalition Strategies. FSTTCS 2020: 39:1-39:17 - [i24]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Synthesizing safe coalition strategies. CoRR abs/2008.03770 (2020) - [i23]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier:
Taming denumerable Markov decision processes with decisiveness. CoRR abs/2008.10426 (2020) - 2019
- [c92]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. CONCUR 2019: 32:1-32:15 - [c90]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Concurrent Parameterized Games. FSTTCS 2019: 31:1-31:15 - [i19]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. CoRR abs/1912.07042 (2019) - 2018
- [j31]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are stochastic transition systems tameable? J. Log. Algebraic Methods Program. 99: 41-96 (2018) - 2017
- [i15]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are Stochastic Transition Systems Tameable? CoRR abs/1703.04806 (2017) - 2016
- [c73]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
Analysing Decisive Stochastic Processes. ICALP 2016: 101:1-101:14 - 2014
- [j24]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski:
Stochastic Timed Automata. Log. Methods Comput. Sci. 10(4) (2014) - 2013
- [i4]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. CoRR abs/1309.2842 (2013) - 2011
- [c47]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. ICALP (2) 2011: 246-257 - 2009
- [c41]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye:
When Are Timed Automata Determinizable? ICALP (2) 2009: 43-54 - 2008
- [c35]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. LICS 2008: 217-226 - [c34]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. QEST 2008: 55-64 - 2007
- [c30]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Probabilistic and Topological Semantics for Timed Automata. FSTTCS 2007: 179-191
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-08 23:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint