default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaure Petrucci
Laure Petrucci-Dauchy
Person information
- affiliation: University of Paris 13, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2001
[b1]Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie:
Systems and Software Verification, Model-Checking Techniques and Tools. Springer 2001, ISBN 978-3-642-07478-3, pp. I-XII, 1-190
Journal Articles
- 2024
- [j24]Luca Bernardinello, Jetty Kleijn, Laure Petrucci:
Preface. Fundam. Informaticae 190(2-4) (2024) - [j23]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. Fundam. Informaticae 192(3-4): 261-312 (2024) - [j22]Jaime Arias, Kyungmin Bae, Carlos Olarte, Peter Csaba Ölveczky, Laure Petrucci, Fredrik Rømming:
Symbolic analysis and parameter synthesis for networks of parametric timed automata with global variables using Maude and SMT solving. Sci. Comput. Program. 233: 103074 (2024) - [j21]Jaime Arias
, Carlos Olarte, Laure Petrucci, Lukasz Masko, Wojciech Penczek, Teofil Sidoruk:
Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative Models. IEEE Trans. Reliab. 73(2): 861-875 (2024) - 2023
- [j20]Ruben Dobler Strand, Lars Michael Kristensen, Laure Petrucci:
Development and Verification of a Microservice Architecture for a Fire Risk Notification System. Trans. Petri Nets Other Model. Concurr. 17: 27-53 (2023) - 2021
- [j19]Camille Coti, Laure Petrucci, César Rodríguez, Marcelo Sousa:
Quasi-optimal partial order reduction. Formal Methods Syst. Des. 57(1): 3-33 (2021) - [j18]Étienne André, Hoang Gia Nguyen, Laure Petrucci, Jun Sun:
Distributed parametric model checking timed automata under non-Zenoness assumption. Formal Methods Syst. Des. 59(1): 253-290 (2021) - 2019
- [j17]Michal Knapik, Étienne André, Laure Petrucci, Wojciech Jamroga, Wojciech Penczek:
Timed ATL: Forget Memory, Just Count. J. Artif. Intell. Res. 66: 197-223 (2019) - [j16]Étienne André, Michal Knapik, Didier Lime, Wojciech Penczek, Laure Petrucci:
Parametric Verification: An Introduction. Trans. Petri Nets Other Model. Concurr. 14: 64-100 (2019) - 2018
- [j15]Christine Choppy, Jörg Desel, Laure Petrucci:
Specialisation and Generalisation of Processes. Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model. 13(Special): 35-46 (2018) - 2013
- [j14]Lars Michael Kristensen, Wojciech Penczek, Laure Petrucci:
Preface. Fundam. Informaticae 122(1-2) (2013) - [j13]Anna Dedova, Laure Petrucci:
From Code to Coloured Petri Nets: Modelling Guidelines. Trans. Petri Nets Other Model. Concurr. 8: 71-88 (2013) - 2012
- [j12]Mohand Cherif Boukala, Laure Petrucci:
Distributed model-checking and counterexample search for CTL logic. Int. J. Crit. Comput. Based Syst. 3(1/2): 44-59 (2012) - [j11]Lom-Messan Hillah, Fabrice Kordon, Charles Lakos, Laure Petrucci:
Extending pnml Scope: A Framework to Combine Petri Nets Types. Trans. Petri Nets Other Model. Concurr. 6: 46-70 (2012) - [j10]Christine Choppy, Anna Dedova, Sami Evangelista, Kais Klai, Laure Petrucci, Samir Youcef:
Modelling and Formal Verification of the NEO Protocol. Trans. Petri Nets Other Model. Concurr. 6: 197-225 (2012) - 2010
- [j9]Christine Choppy, Micaela Mayero, Laure Petrucci:
Coloured Petri net refinement specification and correctness proof with Coq. Innov. Syst. Softw. Eng. 6(3): 195-202 (2010) - 2008
- [j8]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci:
FAST: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transf. 10(5): 401-424 (2008) - 2007
- [j7]Charles Lakos, Laure Petrucci:
Modular state space exploration for timed petri nets. Int. J. Softw. Tools Technol. Transf. 9(3-4): 393-411 (2007) - 2006
- [j6]Fabrice Kordon, Laure Petrucci:
Toward Formal-Methods Oecumenism? IEEE Distributed Syst. Online 7(7) (2006) - 2005
- [j5]Jonathan Billington, Guy Edward Gallasch, Laure Petrucci:
Verification of the Class of Stop-and-Wait Protocols Modelled by Coloured Petri Nets. Nord. J. Comput. 12(3): 251-274 (2005) - 2001
- [j4]Gérard Berthelot, Laure Petrucci:
Specification and validation of a concurrent system: an educational project. Int. J. Softw. Tools Technol. Transf. 3(4): 372-381 (2001) - 2000
- [j3]Søren Christensen, Laure Petrucci:
Modular Analysis of Petri Nets. Comput. J. 43(3): 224-242 (2000) - [j2]Faiza Belala, Mohamed Bettaz, Laure Petrucci-Dauchy:
Concurrent Systems Analysis Using ECATNets. Log. J. IGPL 8(2): 149-164 (2000) - 1994
- [j1]Alain Finkel, Laure Petrucci:
Composition/décomposition de réseaux de petri et de leurs graphes de couverture. RAIRO Theor. Informatics Appl. 28(2): 73-124 (1994)
Conference and Workshop Papers
- 2024
- [c76]Étienne André, Jaime Arias, Benoît Barbot, Francis Hulin-Hubard, Fabrice Kordon, Van-François Le, Laure Petrucci:
CosyVerif: The Path to Formalisms Cohabitation. Petri Nets 2024: 432-444 - [c75]Jaime Arias, Carlos Olarte, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Model Checking and Synthesis for Strategic Timed CTL using Strategies in Rewriting Logic. PPDP 2024: 10:1-10:14 - [c74]Mikael Bisgaard Dahlsen-Jensen, Baptiste Fievet, Laure Petrucci, Jaco van de Pol:
On-The-Fly Algorithm for Reachability in Parametric Timed Games. TACAS (3) 2024: 194-212 - 2023
- [c73]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 - [c72]Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Strategic (Timed) Computation Tree Logic. AAMAS 2023: 382-390 - 2022
- [c71]Ruben Dobler Strand, Lars Michael Kristensen, Laure Petrucci:
Formal Specification and Validation of a Data-driven Software System for Fire Risk Prediction. PNSE@Petri Nets 2022: 1-20 - [c70]Étienne André, Dylan Marinho, Laure Petrucci, Jaco van de Pol:
Efficient Convex Zone Merging in Parametric Timed Automata. FORMATS 2022: 200-218 - [c69]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 - [c68]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 - [c67]Camille Coti, Laure Petrucci, Daniel Alberto Torres González:
A Formal Model for Fault Tolerant Parallel Matrix Factorization. ICECCS 2022: 62-70 - [c66]Sami Evangelista, Laure Petrucci, Lars Michael Kristensen:
Distributed Explicit State Space Exploration with State Reconstruction for RDMA Networks. ICECCS 2022: 107-116 - [c65]Jaime Arias, Michal Knapik, Wojciech Penczek, Laure Petrucci:
Modular Analysis of Tree-Topology Models. ICFEM 2022: 36-53 - 2021
- [c64]Jaime Arias, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
ADT2AMAS: Managing Agents in Attack-Defence Scenarios. AAMAS 2021: 1749-1751 - [c63]Camille Coti, Laure Petrucci, Daniel Alberto Torres González:
Fault-Tolerant LU Factorization Is Low Cost. Euro-Par 2021: 536-549 - [c62]É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 - 2020
- [c61]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 - [c60]Jaco van de Pol, Laure Petrucci:
On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract). WADT 2020: 3-10 - 2019
- [c59]Laure Petrucci, Michal Knapik, Wojciech Penczek, Teofil Sidoruk:
Squeezing State Spaces of (Attack-Defence) Trees. ICECCS 2019: 71-80 - [c58]Étienne André, Vincent Bloemen, Laure Petrucci, Jaco van de Pol:
Minimal-Time Synthesis for Parametric Timed Automata. TACAS (2) 2019: 211-228 - 2018
- [c57]Huyen T. T. Nguyen, César Rodríguez, Marcelo Sousa, Camille Coti, Laure Petrucci:
Quasi-Optimal Partial Order Reduction. CAV (2) 2018: 354-371 - [c56]Camille Coti, Sami Evangelista, Laure Petrucci:
One-Sided Communications for More Efficient Parallel State Space Exploration over RDMA Clusters. Euro-Par 2018: 432-446 - [c55]Laure Petrucci, Jaco van de Pol:
Parameter Synthesis Algorithms for Parametric Interval Markov Chains. FORTE 2018: 121-140 - [c54]Hoang Gia Nguyen, Laure Petrucci, Jaco van de Pol:
Layered and Collecting NDFS with Subsumption for Parametric Timed Automata. ICECCS 2018: 1-9 - [c53]Camille Coti, Sami Evangelista, Laure Petrucci:
State Compression Based on One-Sided Communications for Distributed Model Checking. ICECCS 2018: 41-50 - 2017
- [c52]Étienne André, Laure Petrucci, Wojciech Jamroga, Michal Knapik, Wojciech Penczek:
Timed ATL: Forget Memory, Just Count. AAMAS 2017: 1460-1462 - [c51]Étienne André, Hoang Gia Nguyen, Laure Petrucci:
Efficient Parameter Synthesis Using Optimized State Exploration Strategies. ICECCS 2017: 1-10 - [c50]Étienne André, Hoang Gia Nguyen, Laure Petrucci, Jun Sun:
Parametric Model Checking Timed Automata Under Non-Zenoness Assumption. NFM 2017: 35-51 - 2016
- [c49]Étienne André, Michal Knapik, Wojciech Penczek, Laure Petrucci:
Controlling Actions and Time in Parametric Timed Automata. ACSD 2016: 45-54 - [c48]Camille Coti, Charles Lakos, Laure Petrucci:
Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm. PNSE @ Petri Nets 2016: 255-274 - [c47]Khanh Le, Thang H. Bui, Tho Quan, Laure Petrucci:
A Framework for Fast Congestion Detection in Wireless Sensor Networks Using Clustering and Petri-Net-based Verification. PNSE @ Petri Nets 2016: 329-334 - [c46]Benoît Delahaye, Didier Lime, Laure Petrucci:
Parameter Synthesis for Parametric Interval Markov Chains. VMCAI 2016: 372-390 - 2015
- [c45]Étienne André, Laure Petrucci:
Unifying Patterns for Modelling Timed Relationships in Systems and Properties. PNSE @ Petri Nets 2015: 25-40 - [c44]Étienne André, Laure Petrucci:
Decrypting cryptography. ITHET 2015: 1-5 - [c43]Khanh Le, Thang H. Bui, Tho Quan, Laure Petrucci, Étienne André:
Component-Based Abstraction of Petri Net Models: An Application for Congestion Verification of Wireless Sensor Networks. SoICT 2015: 342-349 - 2014
- [c42]Dinh-Thuan Le, Huu-Vu Nguyen, Van-Tinh Nguyen, Phuong-Nam Mai, Bao-Trung Pham-Duy, Thanh-Tho Quan, Étienne André, Laure Petrucci, Yang Liu:
PeCAn: Compositional Verification of Petri Nets Made Easy. ATVA 2014: 242-247 - [c41]Denis Genon-Catalot, Laure Petrucci, Michel Tabouret:
Nationwide industrial cooperation for long-life learning and apprenticeships. ITHET 2014: 1-6 - [c40]Emmanuel Viennet, Laure Petrucci:
Monitoring students performances in French Institutes of Technology using the ScoDoc software. ITHET 2014: 1-6 - 2013
- [c39]Christine Choppy, Laure Petrucci, Alfred Sanogo:
Coloured Petri Nets Refinements. PNSE+ModPE 2013: 187-201 - [c38]Sami Evangelista, Lars Michael Kristensen, Laure Petrucci:
Multi-threaded Explicit State Space Exploration with State Reconstruction. ATVA 2013: 208-223 - [c37]Étienne André, Giuseppe Pellegrino, Laure Petrucci:
Precise Robustness Analysis of Time Petri Nets with Inhibitor Arcs. FORMATS 2013: 1-15 - [c36]Étienne André, Yousra Lembachar, Laure Petrucci, Francis Hulin-Hubard, Alban Linard, Lom Hillah, Fabrice Kordon:
CosyVerif: An Open Source Extensible Verification Environment. ICECCS 2013: 33-36 - [c35]Étienne André, Benoît Barbot, Clement Demoulins, Lom-Messan Hillah, Francis Hulin-Hubard, Fabrice Kordon, Alban Linard, Laure Petrucci:
A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems. ICFEM 2013: 199-214 - [c34]Kais Klai, Naim Aber, Laure Petrucci:
Verification of Reachability Properties for Time Petri Nets. RP 2013: 159-170 - [c33]Kais Klai, Naim Aber, Laure Petrucci:
A New Approach to Abstract Reachability State Space of Time Petri Nets. TIME 2013: 117-124 - 2012
- [c32]Anna Dedova, Laure Petrucci:
From Code to Coloured Petri Nets: Modelling Guidelines. PNSE 2012: 109-124 - [c31]Sami Evangelista, Alfons Laarman, Laure Petrucci, Jaco van de Pol:
Improved Multi-Core Nested Depth-First Search. ATVA 2012: 269-283 - [c30]Étienne André, Kais Klai, Hanen Ochi, Laure Petrucci:
A Counterexample-Based Incremental and Modular Verification Approach. Monterey Workshop 2012: 283-302 - 2011
- [c29]Lom-Messan Hillah, Fabrice Kordon, Charles Lakos, Laure Petrucci:
Extending PNML Scope: the Prioritised Petri Nets Experience. PNSE 2011: 92-106 - [c28]Christine Choppy, Jörg Desel, Laure Petrucci:
Specialisation and Generalisation of Processes. PNSE 2011: 109-123 - [c27]Sami Evangelista, Laure Petrucci, Samir Youcef:
Parallel Nested Depth-First Searches for LTL Model Checking. ATVA 2011: 381-396 - 2010
- [c26]Christine Choppy, Anna Dedova, Sami Evangelista, Silien Hong, Kais Klai, Laure Petrucci:
The NEO Protocol for Large-Scale Distributed Database Systems: Modelling and Initial Verification. Petri Nets 2010: 145-164 - [c25]Lom-Messan Hillah, Fabrice Kordon, Laure Petrucci, Nicolas Trèves:
PNML Framework: An Extendable Reference Implementation of the Petri Net Markup Language. Petri Nets 2010: 318-327 - [c24]Charles Lakos, Laure Petrucci:
Modular State Spaces for Prioritised Petri Nets. Monterey Workshop 2010: 136-156 - 2009
- [c23]Serge Haddad, Fabrice Kordon, Laure Petrucci, Jean-François Pradat-Peyre, Nicolas Trèves:
Efficient state-based analysis by introducing bags in Petri nets color domains. ACC 2009: 5018-5025 - [c22]Ekkart Kindler, Laure Petrucci:
Towards a Standard for Modular Petri Nets: A Formalisation. Petri Nets 2009: 43-62 - [c21]Christine Choppy, Micaela Mayero, Laure Petrucci:
Coloured Petri net refinement specification, and correctness proof with Coq. NASA Formal Methods 2009: 156-165 - 2008
- [c20]Kais Klai, Laure Petrucci:
Modular construction of the symbolic observation graph. ACSD 2008: 88-97 - [c19]Christine Choppy, Laure Petrucci, Gianna Reggio:
A Modelling Approach with Coloured Petri Nets. Ada-Europe 2008: 73-86 - [c18]Christine Choppy, Micaela Mayero, Laure Petrucci:
Experimenting Formal Proofs of Petri Nets Refinements. Refine@FM 2008: 231-254 - 2007
- [c17]Kais Klai, Laure Petrucci, Michel A. Reniers:
An Incremental and Modular Technique for Checking LTL\X Properties of Petri Nets. FORTE 2007: 280-295 - 2006
- [c16]Hager Karoui, Rushed Kanawati, Laure Petrucci:
Cooperative CBR System for Peer Agent Committee Formation. AP2PC 2006: 51-62 - [c15]Hager Karoui, Rushed Kanawati, Laure Petrucci:
COBRAS: Cooperative CBR System for Bibliographical Reference Recommendation. ECCBR 2006: 76-90 - [c14]Lom Hillah, Fabrice Kordon, Laure Petrucci-Dauchy, Nicolas Trèves:
PN Standardisation: A Survey. FORTE 2006: 307-322 - [c13]Christine Choppy, Serge Haddad, Hanna Klaudel, Fabrice Kordon, Laure Petrucci, Yann Thierry-Mieg:
Tutorial on Formal Methods for Distributed and Cooperative Systems. ICTAC 2006: 362-365 - 2004
- [c12]Charles Lakos, Laure Petrucci:
Modular Analysis of Systems Composed of Semiautonomous Subsystems. ACSD 2004: 185-196 - [c11]Lars Michael Kristensen, Laure Petrucci:
An Approach to Distributed State Space Exploration for Coloured Petri Nets. ICATPN 2004: 474-483 - 2003
- [c10]Laure Petrucci, Jonathan Billington, Lars Michael Kristensen, Zahid H. Qureshi:
Developing a Formal Specification for the Mission System of a Maritime Surveillance Aircraft. ACSD 2003: 92-101 - [c9]Jonathan Billington, Søren Christensen, Kees M. van Hee, Ekkart Kindler, Olaf Kummer, Laure Petrucci, Reinier Post, Christian Stehno, Michael Weber:
The Petri Net Markup Language: Concepts, Technology, and Tools. ICATPN 2003: 483-505 - [c8]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci:
FAST: Fast Acceleration of Symbolikc Transition Systems. CAV 2003: 118-121 - 1998
- [c7]Søren Christensen, Laure Petrucci:
How to determine and use place flows in coloured Petri nets. SMC 1998: 66-71 - 1995
- [c6]Søren Christensen, Laure Petrucci:
Modular State Space Analysis of Coloured Petri Nets. Application and Theory of Petri Nets 1995: 201-217 - 1992
- [c5]Søren Christensen, Laure Petrucci:
Towards a Modular Analysis of Coloured Petri Nets. Application and Theory of Petri Nets 1992: 113-133 - 1991
- [c4]Alain Finkel, Laure Petrucci:
Avoiding State Exposion by Composition of Minimal Covering Graphs. CAV 1991: 169-180 - 1990
- [c3]Christian Dimitrovici, Udo Hummert, Laure Petrucci:
Semantics, composition and net properties of algebraic high-level nets. Applications and Theory of Petri Nets 1990: 93-117 - [c2]Gérard Berthelot, Colette Johnen, Laure Petrucci:
PAPETRI: Environment for the Analysis of Petri Nets. CAV 1990: 13-22 - [c1]Gérard Berthelot, Colette Johnen, Laure Petrucci:
PAPETRI: Environment for the Analysis of PETRI Nets. CAV (DIMACS/AMS volume) 1990: 43-56
Parts in Books or Collections
- 2018
- [p1]Jiri Barnat, Vincent Bloemen, Alexandre Duret-Lutz, Alfons Laarman, Laure Petrucci, Jaco van de Pol, Etienne Renault:
Parallel Model Checking Algorithms for Linear-Time Temporal Logic. Handbook of Parallel Constraint Reasoning 2018: 457-507
Editorship
- 2024
- [e6]Jörg Desel, Laure Petrucci:
Proceedings of the Workshop Petri Net Games, Examples and Quizzes for Education, Contest and Fun co-located with the 45th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2024), Geneva, Switzerland, June 25, 2024. CEUR Workshop Proceedings 3721, CEUR-WS.org 2024 [contents] - 2023
- [e5]Laure Petrucci, Jeremy Sproston:
Formal Modeling and Analysis of Timed Systems - 21st International Conference, FORMATS 2023, Antwerp, Belgium, September 19-21, 2023, Proceedings. Lecture Notes in Computer Science 14138, Springer 2023, ISBN 978-3-031-42625-4 [contents] - 2022
- [e4]Luca Bernardinello, Laure Petrucci:
Application and Theory of Petri Nets and Concurrency - 43rd International Conference, PETRI NETS 2022, Bergen, Norway, June 19-24, 2022, Proceedings. Lecture Notes in Computer Science 13288, Springer 2022, ISBN 978-3-031-06652-8 [contents] - 2017
- [e3]Laure Petrucci, Cristina Seceleanu, Ana Cavalcanti:
Critical Systems: Formal Methods and Automated Verification - Joint 22nd International Workshop on Formal Methods for Industrial Critical Systems - and - 17th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2017, Turin, Italy, September 18-20, 2017, Proceedings. Lecture Notes in Computer Science 10471, Springer 2017, ISBN 978-3-319-67112-3 [contents] - 2014
- [e2]Shang-Wei Lin, Laure Petrucci:
Proceedings 2nd French Singaporean Workshop on Formal Methods and Applications, FSFMA 2014, Singapore, 13th May 2014. EPTCS 156, 2014 [contents] - 2011
- [e1]Lars Michael Kristensen, Laure Petrucci:
Applications and Theory of Petri Nets - 32nd International Conference, PETRI NETS 2011, Newcastle, UK, June 20-24, 2011. Proceedings. Lecture Notes in Computer Science 6709, Springer 2011, ISBN 978-3-642-21833-0 [contents]
Data and Artifacts
- 2022
- [d2]Étienne André, Dylan Marinho, Laure Petrucci, Jaco van de Pol:
Data for paper "Efficient Convex Zone Merging in Parametric Timed Automata". Zenodo, 2022
- [d1]Étienne André, Hoang Gia Nguyen, Laure Petrucci, Jun Sun:
Experimental data for Distributed parametric model checking timed automata under non-Zenoness assumption. Zenodo, 2022
Informal and Other Publications
- 2024
- [i13]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) - [i12]Mikael Bisgaard Dahlsen-Jensen, Baptiste Fievet, Laure Petrucci, Jaco van de Pol:
On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version). CoRR abs/2401.11287 (2024) - 2023
- [i11]Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Strategic (Timed) Computation Tree Logic. CoRR abs/2302.13405 (2023) - [i10]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) - [i9]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
- [i8]Étienne André, Dylan Marinho, Laure Petrucci, Jaco van de Pol:
Efficient Convex Zone Merging in Parametric Timed Automata. CoRR abs/2212.04802 (2022) - 2021
- [i7]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
- [i6]Laure Petrucci, Michal Knapik:
Modular Analysis of Tree-Topology Models. CoRR abs/2012.04739 (2020) - 2019
- [i5]Étienne André, Vincent Bloemen, Laure Petrucci, Jaco van de Pol:
Minimal-Time Synthesis for Parametric Timed Automata. CoRR abs/1902.03013 (2019) - [i4]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) - [i3]Étienne André, Michal Knapik, Didier Lime, Wojciech Penczek, Laure Petrucci:
Parametric Verification: An Introduction. CoRR abs/1907.00555 (2019) - 2018
- [i2]Huyen T. T. Nguyen, César Rodríguez, Marcelo Sousa, Camille Coti, Laure Petrucci:
Quasi-Optimal Partial Order Reduction. CoRR abs/1802.03950 (2018) - 2016
- [i1]Camille Coti, Charles Lakos, Laure Petrucci:
Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm. CoRR abs/1601.03767 (2016)
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-10-24 21:31 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:
