English
Related papers

Related papers: Trace and Testing Metrics on Nondeterministic Prob…

200 papers

Two of the most studied extensions of trace and testing equivalences to nondeterministic and probabilistic processes induce distinctions that have been questioned and lack properties that are desirable. Probabilistic trace-distribution…

Logic in Computer Science · Computer Science 2015-07-01 Marco Bernardo , Rocco De Nicola , Michele Loreti

In this paper we continue our research line on logical characterizations of behavioral metrics obtained from the definition of a metric over the set of logical properties of interest. This time we provide a characterization of both strong…

Logic in Computer Science · Computer Science 2017-07-14 Valentina Castiglioni , Simone Tini

A central paradigm behind process semantics based on observability and testing is that the exact moment of occurring of an internal nondeterministic choice is unobservable. It is natural, therefore, for this property to hold when the…

Logic in Computer Science · Computer Science 2009-07-10 Sonja Georgievska , Suzana Andova

In the paper "Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities" to appear in TCS, we present a comparison of behavioral equivalences for nondeterministic and probabilistic processes. In particular,…

Logic in Computer Science · Computer Science 2013-12-13 Marco Bernardo , Rocco De Nicola , Michele Loreti

We present a spectrum of trace-based, testing, and bisimulation equivalences for nondeterministic and probabilistic processes whose activities are all observable. For every equivalence under study, we examine the discriminating power of…

Logic in Computer Science · Computer Science 2013-06-13 Marco Bernardo , Rocco De Nicola , Michele Loreti

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the…

Logic in Computer Science · Computer Science 2023-06-22 Filippo Bonchi , Ana Sokolova , Valeria Vignudelli

Analysis of execution traces plays a fundamental role in many program analysis approaches, such as runtime verification, testing, monitoring, and specification mining. Execution traces are frequently parametric, i.e., they contain events…

Programming Languages · Computer Science 2015-07-01 Grigore Rosu , Feng Chen

Before we combine actions and probabilities two very obvious questions should be asked. Firstly, what does "the probability of an action" mean? Secondly, how does probability interact with nondeterminism? Neither question has a single…

Software Engineering · Computer Science 2011-06-22 Steve Reeves , David Streader

We present several completely general diversity metrics to quantify the problem-solving capacity of any public policy decision making process. This is performed by modelling the policy process using a declarative process paradigm in…

Artificial Intelligence · Computer Science 2020-08-25 Mark Dukes , Anthony A. Casey

We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our main contributions are presentation results for the monads,…

Logic in Computer Science · Computer Science 2021-04-22 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

Parallelism is often required for performance. In these situations an excess of non-determinism is harmful as it means the program can have several different behaviours or even different results. Even in domains such as high-performance…

Programming Languages · Computer Science 2022-10-28 Laure Gonnord , Ludovic Henrio , Lionel Morel , Gabriel Radanne

Trace properties, which are sets of execution traces, are often used to analyze systems, but their expressiveness is limited. Clarkson and Schneider defined hyperproperties as a generalization of trace properties to sets of sets of traces.…

Logic in Computer Science · Computer Science 2023-10-03 Bernd Finkbeiner , Ernst-Rüdiger Olderog

Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting…

Logic in Computer Science · Computer Science 2019-03-19 Valentin Bura , Tim French , Mark Reynolds

Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…

Logic in Computer Science · Computer Science 2015-07-01 Lukasz Mikulski

Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several…

Logic in Computer Science · Computer Science 2024-12-31 Hao Wu , Yuxi Fu , Huan Long , Xian Xu , Wenbo Zhang

To maintain the desired quality of a product or service it is necessary to monitor the process that results in the product or service. This monitoring method is called Statistical Process Management, or Statistical Process Control. It is in…

Methodology · Statistics 2019-01-15 W. J. Conover , Victor G. Tercero , Alvaro E. Cordero-Franco

We address the problem of measuring inconsistency in declarative process specifications, with an emphasis on linear temporal logic on fixed traces (LTLff). As we will show, existing inconsistency measures for classical logic cannot provide…

Artificial Intelligence · Computer Science 2022-06-16 Carl Corea , John Grant , Matthias Thimm

Software engineering requires rigorous testing to guarantee the product's quality. Semantic testing of functional correctness is challenged by nondeterminism in behavior, which makes testers difficult to write and reason about. This thesis…

Programming Languages · Computer Science 2023-07-07 Yishuai Li

Distribution testing is a fundamental statistical task with many applications, but we are interested in a variety of problems where systematic mislabelings of the sample prevent us from applying the existing theory. To apply distribution…

Data Structures and Algorithms · Computer Science 2023-04-05 Renato Ferreira Pinto , Nathaniel Harms

In regression analysis, associations between continuous predictors and the outcome are often assumed to be linear. However, modeling the associations as non-linear can improve model fit. Many flexible modeling techniques, like (fractional)…

‹ Prev 1 2 3 10 Next ›