Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaime Arias 0001
Person information
- affiliation: CNRS, France
- affiliation: LIPN, France
- affiliation: Sorbonne Paris North University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Jaime Arias, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci:
A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets. CoRR abs/2401.01884 (2024)- 2023
- [c18]Jaime Arias
, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci, Fredrik Rømming:
Symbolic Analysis and Parameter Synthesis for Time Petri Nets Using Maude and SMT Solving. Petri Nets 2023: 369-392 - [c17]Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Strategic (Timed) Computation Tree Logic. AAMAS 2023: 382-390 - [c16]Kais Klai, Mohamed Taha Bennani, Jaime Arias, Jörg Desel, Hanen Ochi:
Symbolic Observation Graph-Based Generation of Test Paths. TAP 2023: 127-146 - [i5]Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Strategic (Timed) Computation Tree Logic. CoRR abs/2302.13405 (2023) - [i4]Jaime Arias, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci, Fredrik Rømming:
Symbolic Analysis and Parameter Synthesis for Time Petri Nets Using Maude and SMT Solving. CoRR abs/2303.08929 (2023) - [i3]Jaime Arias, Carlos Olarte, Laure Petrucci, Lukasz Masko, Wojciech Penczek, Teofil Sidoruk:
Optimal Scheduling of Agents in ADTrees: Specialised Algorithm and Declarative Models. CoRR abs/2305.04616 (2023) - 2022
- [c15]Jaime Arias, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci, Fredrik Rømming:
Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata. FTSCS 2022: 3-15 - [c14]Jaime Arias, Laure Petrucci, Lukasz Masko, Wojciech Penczek, Teofil Sidoruk:
Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. ICECCS 2022: 1-10 - [c13]Jaime Arias, Michal Knapik, Wojciech Penczek, Laure Petrucci:
Modular Analysis of Tree-Topology Models. ICFEM 2022: 36-53 - 2021
- [c12]Jaime Arias, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
ADT2AMAS: Managing Agents in Attack-Defence Scenarios. AAMAS 2021: 1749-1751 - [c11]Étienne André, Jaime Arias, Laure Petrucci, Jaco van de Pol:
Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata. TACAS (1) 2021: 311-329 - [c10]Kais Klai, Chiheb Ameur Abid, Jaime Arias, Sami Evangelista:
Hybrid Parallel Model Checking of Hybrid LTL on Hybrid State Space Representation. VECoS 2021: 27-42 - [i2]Jaime Arias, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. CoRR abs/2101.06838 (2021) - 2020
- [c9]Jaime Arias, Carlos E. Budde, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk, Mariëlle Stoelinga:
Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems. ICFEM 2020: 3-19 - [c8]Chiheb Ameur Abid, Kaïs Klai, Jaime Arias, Hiba Ouni:
SOG-Based Multi-Core LTL Model Checking. ISPA/BDCloud/SocialCom/SustainCom 2020: 9-17
2010 – 2019
- 2019
- [r1]Jaime Arias, Raphaël Marczak, Myriam Desainte-Catherine:
Timed Automata for Video Games and Interaction. Encyclopedia of Computer Graphics and Games 2019 - [i1]Jaime Arias, Carlos E. Budde, Wojciech Penczek, Laure Petrucci, Mariëlle Stoelinga:
Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems. CoRR abs/1906.05283 (2019) - 2017
- [c7]Mauricio Cano, Jaime Arias, Jorge A. Pérez:
Session-Based Concurrency, Reactively. FORTE 2017: 74-91 - [c6]Jaime Arias, Philippe Ciuciu, Michel Dojat, Florence Forbes, Aina Frau-Pascual, Thomas Perret, Jan M. Warnking:
PyHRF: A Python Library for the Analysis of fMRI Data Based on Local Estimation of the Hemodynamic Response Function. SciPy 2017: 34-40 - 2016
- [c5]Jaime Arias, Mauricio Cano, Jorge Andrés Pérez:
Towards A Practical Model of Reactive Communication-Centric Software. ICTCS 2016: 227-233 - 2015
- [b1]Jaime Arias:
Formal Semantics and Automatic Verification of Hierarchical Multimedia Scenarios with Interactive Choices. (Sémantique Formelle et Vérification Automatique de Scénarios Hiérarchiques Multimédia avec des Choix Interactifs). University of Bordeaux, France, 2015 - [c4]Jaime Arias, Myriam Desainte-Catherine, Camilo Rueda:
A Framework for Composition, Verification and Real-Time Performance of Multimedia Interactive Scenarios. ACSD 2015: 140-151 - [c3]Jaime Arias, Myriam Desainte-Catherine, Carlos Olarte, Camilo Rueda:
Foundations for Reliable and Flexible Interactive Multimedia Scores. MCM 2015: 29-41 - 2014
- [c2]Jaime Arias, Myriam Desainte-Catherine, Camilo Rueda:
Modelling Data Processing for Interactive Scores Using Coloured Petri Nets. ACSD 2014: 186-195 - [c1]Jaime Arias, Michell Guzmán, Carlos Olarte:
A Symbolic Model for Timed Concurrent Constraint Programming. LSFA 2014: 161-177
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-04-25 05:40 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:
