Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Basset
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c25]Akshay Mambakam
, Eugene Asarin, Nicolas Basset, Thao Dang:
Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions. HSCC 2023: 14:1-14:13- [c24]Benoît Barbot, Nicolas Basset, Alexandre Donzé:
Wordgen : a Timed word Generation Tool. HSCC 2023: 16:1-16:7 - [c23]Benoît Barbot, Nicolas Basset:
Max-Entropy Sampling for Deterministic Timed Automata Under Linear Duration Constraints. QEST 2023: 188-204 - 2022
- [i4]Franz Mayr, Sergio Yovine, Federico Pan, Nicolas Basset, Thao Dang:
Towards Efficient Active Learning of PDFA. CoRR abs/2206.09004 (2022) - 2021
- [c22]Nicolas Basset, Thao Dang, Felix Gigler, Cristinel Mateis, Dejan Nickovic:
Sampling of shape expressions with ShapEx. MEMOCODE 2021: 118-125 - [i3]Nicolas Basset, Thao Dang, Felix Gigler, Cristinel Mateis, Dejan Nickovic:
Sampling of Shape Expressions. CoRR abs/2106.11041 (2021) - 2020
- [c21]Nicolas Basset, Thao Dang, Akshay Mambakam, José-Ignacio Requeno Jarabo:
Learning Specifications for Labelled Patterns. FORMATS 2020: 76-93 - [c20]Benoît Barbot, Nicolas Basset, Thao Dang, Alexandre Donzé, James Kapinski, Tomoya Yamaguchi:
Falsification of Cyber-Physical Systems with Constrained Signal Spaces. NFM 2020: 420-439
2010 – 2019
- 2019
- [c19]Alexey Bakhirkin, Nicolas Basset, Oded Maler, José-Ignacio Requeno Jarabo:
ParetoLib: A Python Library for Parameter Synthesis. FORMATS 2019: 114-120 - [c18]Benoît Barbot, Nicolas Basset, Thao Dang:
Generation of Signals Under Temporal Constraints for CPS Testing. NFM 2019: 54-70 - [c17]Alexey Bakhirkin, Nicolas Basset:
Specification and Efficient Monitoring Beyond STL. TACAS (2) 2019: 79-97 - 2018
- [j4]Nicolas Basset, Marta Z. Kwiatkowska, Clemens Wiltsche:
Compositional strategy synthesis for stochastic games with multiple objectives. Inf. Comput. 261: 536-587 (2018) - [c16]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond Admissibility: Dominance Between Chains of Strategies. CSL 2018: 10:1-10:22 - [c15]Eugene Asarin, Nicolas Basset, Aldric Degorre:
Distance on Timed Words and Applications. FORMATS 2018: 199-214 - [i2]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond admissibility: Dominance between chains of strategies. CoRR abs/1805.11608 (2018) - 2017
- [c14]Nicolas Basset, Jean-François Raskin, Ocan Sankur:
Admissible Strategies in Timed Games. Models, Algorithms, Logics and Tools 2017: 403-425 - [c13]Nicolas Basset, Jean Mairesse, Michèle Soria:
Uniform Sampling for Networks of Automata. CONCUR 2017: 36:1-36:16 - [c12]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissiblity in Concurrent Games. ICALP 2017: 123:1-123:14 - [c11]Swen Jacobs, Nicolas Basset, Roderick Bloem, Romain Brenguier, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Thibaud Michaud, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur, Leander Tentrup:
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results. SYNT@CAV 2017: 116-143 - [i1]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissibility in Concurrent Games. CoRR abs/1702.06439 (2017) - 2016
- [j3]Nicolas Basset:
Counting and Generating Permutations in Regular Classes. Algorithmica 76(4): 989-1034 (2016) - [c10]Benoît Barbot, Nicolas Basset, Marc Beunardeau, Marta Kwiatkowska:
Uniform Sampling for Timed Automata with Application to Language Inclusion Measurement. QEST 2016: 175-190 - 2015
- [j2]Eugene Asarin, Nicolas Basset, Aldric Degorre:
Entropy of regular timed languages. Inf. Comput. 241: 142-176 (2015) - [j1]Nicolas Basset:
A maximal entropy stochastic process for a timed automaton. Inf. Comput. 243: 50-74 (2015) - [c9]Nicolas Basset:
Timed Symbolic Dynamics. FORMATS 2015: 44-59 - [c8]Nicolas Basset, Marta Z. Kwiatkowska, Ufuk Topcu, Clemens Wiltsche:
Strategy Synthesis for Stochastic Games with Multiple Long-Run Objectives. TACAS 2015: 256-271 - 2014
- [c7]Nicolas Basset, Marta Z. Kwiatkowska, Clemens Wiltsche:
Compositional Controller Synthesis for Stochastic Games. CONCUR 2014: 173-187 - [c6]Nicolas Basset:
Counting and Generating Permutations Using Timed Languages. LATIN 2014: 502-513 - 2013
- [b1]Nicolas Basset:
Volumetry of timed languages and applications. (Volumétrie des langages temporisés et applications). University of Paris-Est, France, 2013 - [c5]Eugene Asarin, Nicolas Basset, Aldric Degorre:
Spectral Gap in Timed Automata. FORMATS 2013: 16-30 - [c4]Nicolas Basset:
A Maximal Entropy Stochastic Process for a Timed Automaton, . ICALP (2) 2013: 61-73 - 2012
- [c3]Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin:
Toward a Timed Theory of Channel Coding. FORMATS 2012: 27-42 - [c2]Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin:
Generating Functions of Timed Languages. MFCS 2012: 124-135 - 2011
- [c1]Nicolas Basset, Eugene Asarin:
Thin and Thick Timed Regular Languages. FORMATS 2011: 113-128
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 2023-09-27 22: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:
