default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmélie Stainer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j3]Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen, Amélie Stainer:
Synthesising succinct strategies in safety games with an application to real-time scheduling. Theor. Comput. Sci. 735: 24-49 (2018)- 2015
- [j2]Nathalie Bertrand
, Amélie Stainer, Thierry Jéron, Moez Krichen:
A game approach to determinize timed automata. Formal Methods Syst. Des. 46(1): 42-80 (2015) - 2014
- [c7]Gilles Geeraerts, Joël Goossens, Amélie Stainer:
Synthesising Succinct Strategies in Safety and Reachability Games. RP 2014: 98-111 - [i3]Gilles Geeraerts, Joël Goossens, Amélie Stainer:
Synthesising Succinct Strategies in Safety Games. CoRR abs/1404.6228 (2014) - 2013
- [b1]Amélie Stainer:
Contribution to the Verification of Timed Automata: Determinization, Quantitative Verification and Reachability in Networks of Automata. (Contribution à la vérification des automates temporisés : déterminisation, vérification quantitative et accessibilité dans les réseaux d'automates). University of Rennes 1, France, 2013 - [c6]Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre:
Reachability of Communicating Timed Processes. FoSSaCS 2013: 81-96 - [i2]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. CoRR abs/1309.2842 (2013) - 2012
- [j1]Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen:
Off-line test selection with test purposes for non-deterministic timed automata. Log. Methods Comput. Sci. 8(4) (2012) - [c5]Amélie Stainer:
Frequencies in Forgetful Timed Automata. FORMATS 2012: 236-251 - [c4]Peter E. Bulychev, Alexandre David, Kim Guldstrand Larsen, Axel Legay, Guangyuan Li, Danny Bøgsted Poulsen, Amélie Stainer:
Monitor-Based Statistical Model Checking for Weighted Metric Temporal Logic. LPAR 2012: 168-182 - [i1]Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre:
Reachability of Communicating Timed Processes. CoRR abs/1209.0571 (2012) - 2011
- [c3]Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen:
A Game Approach to Determinize Timed Automata. FoSSaCS 2011: 245-259 - [c2]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. ICALP (2) 2011: 246-257 - [c1]Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen:
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata. TACAS 2011: 96-111
Coauthor Index
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-05-08 21:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
