Pedro R. D’Argenio

Universidad Nacional de Córdoba — Argentina

Computer Science · Physical Sciences

26h-index2.8kcitations131works1.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Formal Methods in Verification(87), Software Reliability and Analysis Research(31), Petri Nets in System Modeling(30), Logic, programming, and type systems(22), Distributed systems and fault tolerance(21)

Publications131 total

Uncertainty-Aware Routing in Delay-Tolerant Networks: Artifact and Reproducibility Package
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
Uncertainty-Aware Routing in Delay-Tolerant Networks: Artifact and Reproducibility Package
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
Multi-Objective Statistical Model Checking using Lightweight Strategy Sampling (extended version)
ArXiv.org·2025Open Access
How Lucky Are You to Know Your Way? A Probabilistic Approach to Knowing How Logics
2025Open Access
Modest Models and Tools for Real Stochastic Timed Systems
2025Open Access
Polytopal Stochastic Games
Lecture notes in computer science·2025
Polytopal Stochastic Games
arXiv (Cornell University)·2025Open Access
Digging for Decision Trees: A Case Study in Strategy Sampling and Learning
Lecture notes in computer science·2024· 1 cited
Digging for Decision Trees: A Case Study in Strategy Sampling and Learning
arXiv (Cornell University)·2024Open Access
Modest Models and Tools for Real Stochastic Timed Systems
Lecture notes in computer science·2024· 2 citedOpen Access
Tolerange: Quantifying Fault Masking in Stochastic Systems
Lecture notes in computer science·2024
Comparing Statistical, Analytical, and Learning-Based Routing Approaches for Delay-Tolerant Networks
ACM Transactions on Modeling and Computer Simulation·2024· 9 citedOpen Access
Coyan: Fault Tree Analysis – Exact and Scalable
Lecture notes in computer science·2024· 1 cited
Quantifying Masking Fault-Tolerance via Fair Stochastic Games
Electronic Proceedings in Theoretical Computer Science·2023· 1 citedOpen Access
Optimal Route Synthesis in Space DTN Using Markov Decision Processes
Lecture notes in computer science·2023
Preface to the special issue on Open Problems in Concurrency Theory
Journal of Logical and Algebraic Methods in Programming·2022
Analysis of non-Markovian repairable fault trees through rare event simulation
International Journal on Software Tools for Technology Transfer·2022· 5 citedOpen Access
A Stochastic Game Approach to Masking Fault-Tolerance: Bisimulation and Quantification
arXiv (Cornell University)·2022Open Access
Comparing Statistical and Analytical Routing Approaches for Delay-Tolerant Networks
Lecture notes in computer science·2022· 7 citedOpen Access
Playing Against Fair Adversaries in Stochastic Games with Total Rewards
Lecture notes in computer science·2022· 3 citedOpen Access
page 1 of 7Next →

Frequent Co-authors

Joost-Pieter Katoen(10), Holger Hermanns(6), Carlos E. Budde(6), Arnd Hartmanns(6), Gilles Barthe(5), Sean Sedwards(5), Ed Brinksma(5), Sergio Giro(4), Tamara Rezk(3), Bertrand Jeannet(3), Kim G. Larsen(3), Matias David Lee(3), Henrik Ejersbo Jensen(2), Axel Legay(2), Peter Niebert(2), Pedro Sánchez Terraf(2), Nicolás Wolovick(2), Luis María Ferrer Fioriti(2), Bernd Finkbeiner(2), Kaustubh Joshi(2)