Pedro R. D'Argenio
According to our database1, Pedro R. D'Argenio authored at least 65 papers between 1995 and 2019.
Legend:Book In proceedings Article PhD thesis Other
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
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
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
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
Smart sampling for lightweight verification of Markov decision processes.
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
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
Bisimulations for non-deterministic labelled Markov processes.
Mathematical Structures in Computer Science, 2012
Reconciling real and stochastic time: the need for probabilistic refinement.
Formal Asp. 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
Semantics for Interactive Sequential Systems and Non-Interference Properties.
CLEI Electron. J., 2011
Describing Secure Interfaces with Interface Automata.
Electr. Notes Theor. Comput. Sci., 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
On the Expressive Power of Schedulers in Distributed Probabilistic Systems.
Electr. Notes Theor. Comput. Sci., 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
Significant Diagnostic Counterexamples in Probabilistic Model Checking.
Proceedings of the Hardware and Software: Verification and Testing, 2008
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems.
IEEE Trans. Software Eng., 2006
Partial Order Reduction for Probabilistic Branching Time.
Electr. Notes Theor. Comput. Sci., 2006
A theory of Stochastic systems. Part II: Process algebra.
Inf. Comput., 2005
A theory of stochastic systems part I: Stochastic automata.
Inf. Comput., 2005
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005
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
Secure Information Flow by Self-Composition.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004
Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems.
J. Log. Algebr. Program., 2003
Reduction and Refinement Strategies for Probabilistic Analysis.
Proceedings of the Process Algebra and Probabilistic Methods, 2002
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
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
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
On Generative Parallel Composition.
Electr. Notes Theor. Comput. Sci., 1999
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality.
Proceedings of the 20th IEEE Real-Time Systems Symposium, 1999
An algebraic approach to the specification of stochastic systems.
Proceedings of the Programming Concepts and Methods, 1998
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
A Calculus for Timed Automata.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996
Delayed choice for process algebra with abstraction.
Proceedings of the CONCUR '95: Concurrency Theory, 1995