Pedro R. D'Argenio

Orcid: 0000-0002-8528-9215

Affiliations:
  • Saarland University, Saarbrücken, Germany
  • National University of Córdoba, FAMAF, Argentina


According to our database1, Pedro R. D'Argenio authored at least 84 papers between 1995 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Artifact for "Coyan: Fault Tree Analysis - Exact and Scalable".
Dataset, May, 2024

Tolerange: Quantifying Fault Masking in Stochastic Systems.
Proceedings of the Model Checking Software - 30th International Symposium, 2024

Coyan: Fault Tree Analysis - Exact and Scalable.
Proceedings of the Computer Safety, Reliability, and Security, 2024

2023
Preface to the special issue on Open Problems in Concurrency Theory.
J. Log. Algebraic Methods Program., 2023

Quantifying Masking Fault-Tolerance via Fair Stochastic Games.
Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

Optimal Route Synthesis in Space DTN Using Markov Decision Processes.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

2022
Analysis of non-Markovian repairable fault trees through rare event simulation.
Int. J. Softw. Tools Technol. Transf., 2022

A Stochastic Game Approach to Masking Fault-Tolerance: Bisimulation and Quantification.
CoRR, 2022

MaskD: A Tool for Measuring Masking Fault-Tolerance.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Comparing Statistical and Analytical Routing Approaches for Delay-Tolerant Networks.
Proceedings of the Quantitative Evaluation of Systems - 19th International Conference, 2022

Playing Against Fair Adversaries in Stochastic Games with Total Rewards.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Doping Tests for Cyber-physical Systems.
ACM Trans. Model. Comput. Simul., 2021

Routing in Delay-Tolerant Networks under uncertain contact plans.
Ad Hoc Networks, 2021

2020
An efficient statistical model checker for nondeterminism and rare events.
Int. J. Softw. Tools Technol. Transf., 2020

On the probabilistic bisimulation spectrum with silent moves.
Acta Informatica, 2020

Rare Event Simulation for Non-Markovian Repairable Fault Trees.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Sampling Distributed Schedulers for Resilient Space Communication.
Proceedings of the NASA Formal Methods - 12th International Symposium, 2020

A compositional semantics for Repairable Fault Trees with general distributions.
Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019
Automated compositional importance splitting.
Sci. Comput. Program., 2019

Measuring Masking Fault-Tolerance.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

2018
A Markov Decision Process for Routing in Space DTNs with Uncertain Contact Plans.
Proceedings of the 6th IEEE International Conference on Wireless for Space and Extreme Environments, 2018

A Statistical Model Checker for Nondeterminism and Rare Events.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Lightweight Statistical Model Checking in Nondeterministic Continuous Time.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification, 2018

Input/Output Stochastic Automata with Urgency: Confluence and Weak Determinism.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

A Hierarchy of Scheduler Classes for Stochastic Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

Cyber-Physical Doping Tests.
Proceedings of the 3rd Workshop on Monitoring and Testing of Cyber-Physical Systems, 2018

2017
Efficient simulation-based verification of probabilistic timed automata.
Proceedings of the 2017 Winter Simulation Conference, 2017

Better Automated Importance Splitting for Transient Rare Events.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

Is Your Software on Dope? - Formal Analysis of Surreptitiously "enhanced" Programs.
Proceedings of the Programming Languages and Systems, 2017

The Road from Stochastic Automata to the Simulation of Rare Events.
Proceedings of the ModelEd, TestEd, TrustEd, 2017

2016
A general SOS theory for the specification of probabilistic transition systems.
Inf. Comput., 2016

Compositional Construction of Importance Functions in Fully Automated Importance Splitting.
Proceedings of the 10th EAI International Conference on Performance Evaluation Methodologies and Tools, 2016

Facets of Software Doping.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata.
Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

Input/Output Stochastic Automata - Compositionality and Determinism.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

2015
Smart sampling for lightweight verification of Markov decision processes.
Int. J. Softw. Tools Technol. Transf., 2015

SOS rule formats for convex and abstract probabilistic bisimulations.
Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, 2015

Rare Event Simulation with Fully Automated Importance Splitting.
Proceedings of the Computer Performance Engineering - 12th European Workshop, 2015

2014
Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms.
Theor. Comput. Sci., 2014

Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2012
Bisimulations for non-deterministic labelled Markov processes.
Math. Struct. Comput. Sci., 2012

Reconciling real and stochastic time: the need for probabilistic refinement.
Formal Aspects Comput., 2012

Tree rules in probabilistic transition system specifications with negative and quantitative premises
Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

Security Analysis in Probabilistic Distributed Protocols via Bounded Reachability.
Proceedings of the Trustworthy Global Computing - 7th International Symposium, 2012

A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems.
Proceedings of the Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems, 2012

Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
Secure information flow by self-composition.
Math. Struct. Comput. Sci., 2011

Semantics for Interactive Sequential Systems and Non-Interference Properties.
CLEI Electron. J., 2011

2010
Describing Secure Interfaces with Interface Automata.
Proceedings of the 7th International Workshop on Formal Engineering approaches to Software Components and Architectures, 2010

Bisimulations for Nondeterministic Labeled Markov Processes
CoRR, 2010

Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains.
Proceedings of the Model Checking Software, 2010

A Refinement Based Notion of Non-interference for Interface Automata: Compositionality, Decidability and Synthesis.
Proceedings of the SCCC 2010, 2010

2009
On the Expressive Power of Schedulers in Distributed Probabilistic Systems.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages, 2009

On the verification of probabilistic I/O automata with unspecified rates.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Nondeterministic Labeled Markov Processes: Bisimulations and Logical Characterization.
Proceedings of the QEST 2009, 2009

Optimizing Probabilities of Real-Time Test Case Execution.
Proceedings of the Second International Conference on Software Testing Verification and Validation, 2009

Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Significant Diagnostic Counterexamples in Probabilistic Model Checking.
Proceedings of the Hardware and Software: Verification and Testing, 2008

2007
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007

2006
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems.
IEEE Trans. Software Eng., 2006

2005
Axiomatising divergence.
Inf. Comput., 2005

A theory of Stochastic systems. Part II: Process algebra.
Inf. Comput., 2005

A theory of stochastic systems part I: Stochastic automata.
Inf. Comput., 2005

Partial Order Reduction for Probabilistic Branching Time.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages, 2005

The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Tutte le Algebre Insieme: Concepts, Discussions and Relations of Stochastic Process Algebras with General Distributions.
Proceedings of the Validation of Stochastic Systems - A Guide to Current Research, 2004

Partial Order Reduction on Concurrent Probabilistic Programs.
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

2003
Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems.
J. Log. Algebraic Methods Program., 2003

2002
Reduction and Refinement Strategies for Probabilistic Analysis.
Proceedings of the Process Algebra and Probabilistic Methods, 2002

2001
Testing timed automata.
Theor. Comput. Sci., 2001

Reachability Analysis of Probabilistic Systems by Successive Refinements.
Proceedings of the Process Algebra and Probabilistic Methods, 2001

MoDeST - A Modelling and Description Language for Stochastic Timed Systems.
Proceedings of the Process Algebra and Probabilistic Methods, 2001

2000
UPPAAL - Now, Next, and Future.
Proceedings of the Modeling and Verification of Parallel Processes, 4th Summer School, 2000

From Semantics to Spatial Distribution.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

General Distributions in Process Algebra.
Proceedings of the Lectures on Formal Methods and Performance Analysis, 2000

1999
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality.
Proceedings of the 20th IEEE Real-Time Systems Symposium, 1999

1998
On Generative Parallel Composition.
Proceedings of the First International Workshop on Probabilistic Methods in Verification, 1998

An algebraic approach to the specification of stochastic systems.
Proceedings of the Programming Concepts and Methods, 1998

1997
A General Conservative Extension Theorem in Process Algebras with Inequalities.
Theor. Comput. Sci., 1997

The Bounded Retransmission Protocol Must Be on Time!
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1997

Regular Processes and Timed Automata.
Proceedings of the Transformation-Based Reactive Systems Development, 1997

1996
A Calculus for Timed Automata.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

1995
Delayed choice for process algebra with abstraction.
Proceedings of the CONCUR '95: Concurrency Theory, 1995


  Loading...