Results 1 to 10 of about 74,253 (260)

Deterministic Receptive Processes are Kahn Processes

open access: yesProceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05., 2005
Deterministic asynchronous concurrent formalisms are valuable because determinism greatly simplifies the design and validation of such systems and most concurrent formalisms are nondeterministic.
Edwards, Stephen A., Tardieu, Olivier
core   +3 more sources

Infinite dimensional Piecewise Deterministic Markov Processes

open access: yesStochastic Processes and their Applications, 2023
In this paper we aim to construct infinite dimensional versions of well established Piecewise Deterministic Monte Carlo methods, such as the Bouncy Particle Sampler, the Zig-Zag Sampler and the Boomerang Sampler.
Dobson, P. (author)   +1 more
core   +7 more sources

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)

open access: yesLogical Methods in Computer Science, 2023
We study encodings of the lambda-calculus into the pi-calculus in the unexplored case of calculi with non-determinism and failures. On the sequential side, we consider lambdafail, a new non-deterministic calculus in which intersection types control ...
Pérez, Jorge A.   +8 more
core   +9 more sources

Jump processes with deterministic and stochastic controls [PDF]

open access: yesPhysical Review E, 2019
We consider the dynamics of a 1D system evolving according to a deterministic drift and randomly forced by two types of jumps processes, one representing an external, uncontrolled forcing and the other one a control that instantaneously resets the system according to specified protocols (either deterministic or stochastic). We develop a general theory,
Bartlett, Mark S.   +2 more
openaire   +4 more sources

Deterministic vs. Non Deterministic Finite Automata in Automata Processing

open access: yesCoRR, 2022
Linear-time pattern matching engines have seen promising results using Finite Automata (FA) as their computation model. Among different FA variants, deterministic (DFA) and non-deterministic (NFA) are the most commonly used computation models for FA-based pattern matching engines.
Farzana Ahmed Siddique   +3 more
openaire   +2 more sources

Non-Deterministic Functions as Non-Deterministic Processes [PDF]

open access: yes, 2021
We study encodings of the λ-calculus into the π-calculus in the unexplored case of calculi with non-determinism and failures. On the sequential side, we consider λ^↯_⊕, a new non-deterministic calculus in which intersection types control resources (terms)
Pérez, Jorge A.   +9 more
core   +2 more sources

Piecewise deterministic Markov processes and their invariant measures [PDF]

open access: yesAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2021
Piecewise Deterministic Markov Processes (PDMPs) are studied in a general framework. First, different constructions are proven to be equivalent. Second, we introduce a coupling between two PDMPs following the same differential flow which implies quantitative bounds on the total variation between the marginal distributions of the two processes.
Durmus, Alain   +2 more
openaire   +2 more sources

Are Deterministic Descriptions And Indeterministic Descriptions Observationally Equivalent? [PDF]

open access: yes, 2009
The central question of this paper is: are deterministic and indeterministic descriptions observationally equivalent in the sense that they give the same predictions?
Werndl, Charlotte, Charlotte Werndl
core   +1 more source

Monte Carlo filtering of piecewise deterministic processes [PDF]

open access: yes, 2011
We present efficient Monte Carlo algorithms for performing Bayesian inference in a broad class of models: those in which the distributions of interest may be represented by time marginals of continuous-time jump processes conditional on a realisation of
Godsill, S   +5 more
core   +1 more source

Deterministic Chance [PDF]

open access: yes, 2009
I argue that there are non-trivial objective chances (that is, objective chances other than 0 and 1) even in deterministic worlds. The argument is straightforward.
Glynn, Luke, Glynn, L
core   +1 more source

Home - About - Disclaimer - Privacy