English
Related papers

Related papers: Process Symmetry in Probabilistic Transducers

200 papers

Model checking approaches can be divided into two broad categories: global approaches that determine the set of all states in a model M that satisfy a temporal logic formula f, and local approaches in which, given a state s in M, the…

Logic in Computer Science · Computer Science 2014-10-29 Diego Latella , Michele Loreti , Mieke Massink

Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude…

Logic in Computer Science · Computer Science 2012-10-10 Martin Lange , Etienne Lozes , Manuel Vargas Guzmán

In top-down multi-level design methodologies, design descriptions at higher levels of abstraction are incrementally refined to the final realizations. Simulation based techniques have traditionally been used to verify that such model…

Logic in Computer Science · Computer Science 2013-08-02 Salim Ismail Al-Akhras , Sofiène Tahar , Gabriela Nicolescu , Michel Langevin , Pierre Paulin

Conformance checking is a set of process mining functions that compare process instances with a given process model. It identifies deviations between the process instances' actual behaviour ("as-is") and its modelled behaviour ("to-be").…

Software Engineering · Computer Science 2020-07-22 Sebastian Dunzer , Matthias Stierle , Martin Matzner , Stephan Baier

Modern distributed systems include a class of applications in which non-functional requirements are important. In particular, these applications include multimedia facilities where real time constraints are crucial to their correct…

Multimedia · Computer Science 2007-05-23 Jeremy Bryans , Howard Bowman , John Derrick

Symmetry -- invariance to certain operators -- is a fundamental concept in many branches of physics. We propose ways to measure symmetric properties of vertices, and their surroundings, in networks. To be stable to the randomness inherent…

Disordered Systems and Neural Networks · Physics 2008-06-29 Petter Holme

Symmetry tests provide an important probe for the structure of elementary particle interactions and for the validity of the standard model. However, it is pointed out that in the interpretation of such experiments one must keep in mind that…

High Energy Physics - Phenomenology · Physics 2011-04-15 Barry R. Holstein

Formal methods apply algorithms based on mathematical principles to enhance the reliability of systems. It would only be natural to try to progress from verification, model checking or testing a system against its formal specification into…

Software Engineering · Computer Science 2014-02-28 Gal Katz , Doron Peled

Probabilistic bisimulation is a fundamental notion of process equivalence for probabilistic systems. Among others, it has important applications including formalizing the anonymity property of several communication protocols. There is a lot…

Software Engineering · Computer Science 2020-11-05 Chih-Duo Hong , Anthony W. Lin , Rupak Majumdar , Philipp Rümmer

We call an objective function or algorithm symmetric with respect to an input if after swapping two parts of the input in any algorithm, the solution of the algorithm and the output remain the same. More formally, for a permutation $\pi$ of…

Data Structures and Algorithms · Computer Science 2021-01-14 Sepideh Aghamolaei

The design of a system and its implementation are two tasks often carried out by different individuals on a development team, and can occur weeks or months apart. This creates a potential for divergence between real behavior and the…

Software Engineering · Computer Science 2026-05-11 Reid Anderson , Hassan Reza

This paper proposes new parametric model adequacy tests for possibly nonlinear and nonstationary time series models with noncontinuous data distribution, which is often the case in applied work. In particular, we consider the correct…

Statistics Theory · Mathematics 2021-08-10 Igor Kheifets , Carlos Velasco

We consider a permutation method for testing whether observations given in their natural pairing exhibit an unusual level of similarity in situations where any two observations may be similar at some unknown baseline level. Under a null…

Statistics Theory · Mathematics 2007-06-13 Larry Goldstein , Yosef Rinott

Symmetries are a key concept to connect mathematical elegance with physical insight. We consider measurement assemblages in quantum mechanics and show how their symmetry can be described by means of the so-called discrete bundles. It turns…

Quantum Physics · Physics 2020-03-30 H. Chau Nguyen , Sébastien Designolle , Mohamed Barakat , Otfried Gühne

Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented. This requires conformance checking between the original and the mutated model. This paper…

Software Engineering · Computer Science 2012-02-29 Bernhard K. Aichernig , Elisabeth Jöbstl

We report on an effort to develop methodologies for formal verification of parts of the Multi-Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of communicating processes. While the individual…

Logic in Computer Science · Computer Science 2007-05-23 Olga Shumsky Matlin , William McCune , Ewing Lusk

We consider the model checking problem of infinite state systems given in the form of parameterized discrete timed networks with multiple clocks. We show that this problem is decidable with respect to specifications given by B- or…

Logic in Computer Science · Computer Science 2016-09-15 Benjamin Aminof , Sasha Rubin , Francesco Spegni , Florian Zuleger

The validation of data from sensors has become an important issue in the operation and control of modern industrial plants. One approach is to use knowledge based techniques to detect inconsistencies in measured data. This article presents…

Artificial Intelligence · Computer Science 2013-02-18 Pablo H. Ibarguengoytia , Luis Enrique Sucar , Sunil Vadera

Fault-tolerant distributed algorithms are central for building reliable spatially distributed systems. Unfortunately, the lack of a canonical precise framework for fault-tolerant algorithms is an obstacle for both verification and…

Formal Languages and Automata Theory · Computer Science 2012-10-16 Annu John , Igor Konnov , Ulrich Schmid , Helmut Veith , Josef Widder

Probabilistic model checking can provide formal guarantees on the behavior of stochastic models relating to a wide range of quantitative properties, such as runtime, energy consumption or cost. But decision making is typically with respect…

Logic in Computer Science · Computer Science 2024-03-19 Ingy Elsayed-Aly , David Parker , Lu Feng