17 citations · 22 across the 10 of their papers we have counts for
10 papers · 1 filter
Effective Stochastic Automata Model Checking by Interval Abstraction (extended version)
Pedro R. D'Argenio, Arnd Hartmanns, Annabell Petri
Stochastic automata (SA) are a formal stochastic continuous-time model based on countdown timers whose expiration times follow general probability distributions. SA are particularl…
Multi-Objective Statistical Model Checking using Lightweight Strategy Sampling (extended version)
Pedro R. D'Argenio, Arnd Hartmanns, Patrick Wienhöft +1
Statistical model checking delivers quantitative verification results with statistical guarantees. It scales to model sizes and model types that are out of reach for exhaustive, an…
Quantifying Masking Fault-Tolerance via Fair Stochastic Games
Pablo F. Castro, Pedro R. D'Argenio, Ramiro Demasi +1
We introduce a formal notion of masking fault-tolerance between probabilistic transition systems using stochastic games. These games are inspired in bisimulation games, but they al…
Doping Tests for Cyber-Physical Systems
Sebastian Biewer, Pedro D'Argenio, Holger Hermanns
The software running in embedded or cyber-physical systems (CPS) is typically of proprietary nature, so users do not know precisely what the systems they own are (in)capable of doi…
Measuring Masking Fault-Tolerance
Pablo F. Castro, Pedro R. D'Argenio, Ramiro Demasi +1
In this paper we introduce a notion of fault-tolerance distance between labeled transition systems. Intuitively, this notion of distance measures the degree of fault-tolerance exhi…
Input/Output Stochastic Automata with Urgency: Confluence and weak determinism
Pedro R. D'Argenio, Raúl E. Monti
In a previous work, we introduced an input/output variant of stochastic automata (IOSA) that, once the model is closed (i.e., all synchronizations are resolved), the resulting auto…