scholarly journals Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

2021 ◽  
pp. 42-61
Author(s):  
A. R. Balasubramanian ◽  
Javier Esparza ◽  
Mikhail Raskin
Keyword(s):  
Lower Bounds ◽  
Petri Net ◽  
Special Class ◽  
Upper Bounds ◽  
Initial State ◽  
Reachability Problem ◽  
Final State ◽  
Final Configuration ◽  
Finite State ◽  
State Agents

AbstractIn rendez-vous protocols an arbitrarily large number of indistinguishable finite-state agents interact in pairs. The cut-off problem asks if there exists a number B such that all initial configurations of the protocol with at least B agents in a given initial state can reach a final configuration with all agents in a given final state. In a recent paper [17], Horn and Sangnier prove that the cut-off problem is equivalent to the Petri net reachability problem for protocols with a leader, and in "Image missing" for leaderless protocols. Further, for the special class of symmetric protocols they reduce these bounds to "Image missing" and "Image missing" , respectively. The problem of lowering these upper bounds or finding matching lower bounds is left open. We show that the cut-off problem is "Image missing" -complete for leaderless protocols, "Image missing" -complete for symmetric protocols with a leader, and in "Image missing" for leaderless symmetric protocols, thereby solving all the problems left open in [17].

scholarly journals Towards efficient verification of population protocols

2021 ◽  
Author(s):  
Michael Blondin ◽  
Javier Esparza ◽  
Stefan Jaax ◽  
Philipp J. Meyer
Keyword(s):  
Linear Constraints ◽  
Computational Power ◽  
High Complexity ◽  
Reachability Problem ◽  
Population Protocols ◽  
Finite State ◽  
State Agents ◽  
Efficient Verification ◽  
Primitive Recursive ◽  
Very High

AbstractPopulation protocols are a well established model of computation by anonymous, identical finite-state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is -hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class $${ WS}^3$$ WS 3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that $${ WS}^3$$ WS 3 has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership and correctness problems for $${ WS}^3$$ WS 3 reduce to solving boolean combinations of linear constraints over $${\mathbb {N}}$$ N . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.

Modeling and Solving Product Configuration Problems Using Petri Net

2011 ◽  
Vol 201-203 ◽  
pp. 1379-1383
Author(s):  
Dong Yang
Keyword(s):  
Petri Net ◽  
Mass Customization ◽  
Discrete Systems ◽  
Product Configuration ◽  
Enabling Technology ◽  
Initial State ◽  
Final State ◽  
Structural Relationships ◽  
Configuration Problem

This Product configuration is a key enabling technology for implementing mass customization production. In this paper, we present an approach for modeling product configuration problems using Petri Net, a well-defined formalism for describing complex discrete systems. In the presented approach, components within a configurable product are modeled as places of PN whereas structural relationships between components are represented as transitions of PN. Configuration rules such as inclusion and exclusion rules are also described through the elements of PN. By modeling product configuration as a PN, a configuration solution is a set of transitions leading from the initial state of PN to a final state of PN. Therefore, the configuration problem can be solved by analyzing corresponding PN representation.

A Petri-Net Approach for Modeling Product Configuration Problems under Mass Customization

2011 ◽  
Vol 215 ◽  
pp. 107-110
Author(s):  
Dong Yang
Keyword(s):  
Petri Net ◽  
Mass Customization ◽  
Discrete Systems ◽  
Product Configuration ◽  
Enabling Technology ◽  
Initial State ◽  
Final State ◽  
Structural Relationships ◽  
Configuration Problem

Product configuration is a key enabling technology for implementing mass customization production. In this paper, we present an approach for modeling product configuration problems using Petri Net, a well-defined formalism for describing complex discrete systems. In the presented approach, components within a configurable product are modeled as places of PN whereas structural relationships between components are represented as transitions of PN. Configuration rules such as inclusion and exclusion rules are also described through the elements of PN. By modeling product configuration as a PN, a configuration solution is a set of transitions leading from the initial state of PN to a final state of PN. Therefore, the configuration problem can be solved by analyzing corresponding PN representation.

scholarly journals The complexity of verifying population protocols

2021 ◽  
Vol 34 (2) ◽  
pp. 133-177
Author(s):  
Javier Esparza ◽  
Stefan Jaax ◽  
Mikhail Raskin ◽  
Chana Weil-Kennedy
Keyword(s):  
Expressive Power ◽  
Property A ◽  
Reachability Problem ◽  
Seminal Paper ◽  
Population Protocols ◽  
Finite State ◽  
State Agents ◽  
Exhaustive Study ◽  
Main Model ◽  
Main Population

AbstractPopulation protocols (Angluin et al. in PODC, 2004) are a model of distributed computation in which indistinguishable, finite-state agents interact in pairs to decide if their initial configuration, i.e., the initial number of agents in each state, satisfies a given property. In a seminal paper Angluin et al. classified population protocols according to their communication mechanism, and conducted an exhaustive study of the expressive power of each class, that is, of the properties they can decide (Angluin et al. in Distrib Comput 20(4):279–304, 2007). In this paper we study the correctness problem for population protocols, i.e., whether a given protocol decides a given property. A previous paper (Esparza et al. in Acta Inform 54(2):191–215, 2017) has shown that the problem is decidable for the main population protocol model, but at least as hard as the reachability problem for Petri nets, which has recently been proved to have non-elementary complexity. Motivated by this result, we study the computational complexity of the correctness problem for all other classes introduced by Angluin et al., some of which are less powerful than the main model. Our main results show that for the class of observation models the complexity of the problem is much lower, ranging from $$\varPi _2^p$$ Π 2 p to .

scholarly journals Multilevel Monte Carlo methods and lower–upper bounds in initial margin computations

2020 ◽  
Vol 26 (2) ◽  
pp. 131-161
Author(s):  
Florian Bourgey ◽  
Stefano De Marco ◽  
Emmanuel Gobet ◽  
Alexandre Zhou
Keyword(s):  
Monte Carlo ◽  
Lower Bounds ◽  
Asymptotic Optimality ◽  
Upper Bounds ◽  
Upper And Lower Bounds ◽  
Independent Random Variables ◽  
Outer Function ◽  
Control Problems ◽  
Multilevel Monte Carlo ◽  
Primal Dual

AbstractThe multilevel Monte Carlo (MLMC) method developed by M. B. Giles [Multilevel Monte Carlo path simulation, Oper. Res. 56 2008, 3, 607–617] has a natural application to the evaluation of nested expectations {\mathbb{E}[g(\mathbb{E}[f(X,Y)|X])]}, where {f,g} are functions and {(X,Y)} a couple of independent random variables. Apart from the pricing of American-type derivatives, such computations arise in a large variety of risk valuations (VaR or CVaR of a portfolio, CVA), and in the assessment of margin costs for centrally cleared portfolios. In this work, we focus on the computation of initial margin. We analyze the properties of corresponding MLMC estimators, for which we provide results of asymptotic optimality; at the technical level, we have to deal with limited regularity of the outer function g (which might fail to be everywhere differentiable). Parallel to this, we investigate upper and lower bounds for nested expectations as above, in the spirit of primal-dual algorithms for stochastic control problems.

scholarly journals Dual subtractions

2021 ◽  
Vol 2021 (6) ◽  
Author(s):  
Renato Maria Prisco ◽  
Francesco Tramontano
Keyword(s):  
Field Theory ◽  
Quantum Field ◽  
Matrix Elements ◽  
Leading Order ◽  
Initial State ◽  
Final State ◽  
Dual Representation ◽  
Subtraction Scheme ◽  
Theoretical Predictions ◽  
Perturbative Quantum

Abstract We propose a novel local subtraction scheme for the computation of Next-to-Leading Order contributions to theoretical predictions for scattering processes in perturbative Quantum Field Theory. With respect to well known schemes proposed since many years that build upon the analysis of the real radiation matrix elements, our construction starts from the loop diagrams and exploits their dual representation. Our scheme implements exact phase space factorization, handles final state as well as initial state singularities and is suitable for both massless and massive particles.

scholarly journals Decay amplitudes to three hadrons from finite-volume matrix elements

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Maxwell T. Hansen ◽  
Fernando Romero-López ◽  
Stephen R. Sharpe
Keyword(s):  
Finite Volume ◽  
Decay Amplitude ◽  
Weak Decay ◽  
Matrix Elements ◽  
Isospin Breaking ◽  
Final State ◽  
Identical Particles ◽  
Hadron Decay ◽  
Finite State ◽  
Particle Decays

Abstract We derive relations between finite-volume matrix elements and infinite-volume decay amplitudes, for processes with three spinless, degenerate and either identical or non-identical particles in the final state. This generalizes the Lellouch-Lüscher relation for two-particle decays and provides a strategy for extracting three-hadron decay amplitudes using lattice QCD. Unlike for two particles, even in the simplest approximation, one must solve integral equations to obtain the physical decay amplitude, a consequence of the nontrivial finite-state interactions. We first derive the result in a simplified theory with three identical particles, and then present the generalizations needed to study phenomenologically relevant three-pion decays. The specific processes we discuss are the CP-violating K → 3π weak decay, the isospin-breaking η → 3π QCD transition, and the electromagnetic γ* → 3π amplitudes that enter the calculation of the hadronic vacuum polarization contribution to muonic g − 2.

scholarly journals On the Interactive Capacity of Finite-State Protocols

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 17
Author(s):  
Assaf Ben-Yishai ◽  
Young-Han Kim ◽  
Rotem Oshman ◽  
Ofer Shayevitz
Keyword(s):  
Lower Bounds ◽  
Upper Bound ◽  
Noisy Channel ◽  
Shannon Capacity ◽  
Finite State

The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the interactive capacity is notoriously difficult, and the best known lower bounds are far below the associated Shannon capacity, which serves as a trivial (and also generally the best known) upper bound. This paper considers the more restricted setup of simulating finite-state protocols. It is shown that all two-state protocols, as well as rich families of arbitrary finite-state protocols, can be simulated at the Shannon capacity, establishing the interactive capacity for those families of protocols.

scholarly journals Bounding the Size and Probability of Epidemics on Networks

2008 ◽  
Vol 45 (2) ◽  
pp. 498-512 ◽  
Author(s):  
Joel C. Miller
Keyword(s):  
Infectious Disease ◽  
Lower Bounds ◽  
Upper Bounds ◽  
Marginal Probability ◽  
Transmission Properties ◽  
Disease Spreading ◽  
Special Case

We consider an infectious disease spreading along the edges of a network which may have significant clustering. The individuals in the population have heterogeneous infectiousness and/or susceptibility. We define the out-transmissibility of a node to be the marginal probability that it would infect a randomly chosen neighbor given its infectiousness and the distribution of susceptibility. For a given distribution of out-transmissibility, we find the conditions which give the upper (or lower) bounds on the size and probability of an epidemic, under weak assumptions on the transmission properties, but very general assumptions on the network. We find similar bounds for a given distribution of in-transmissibility (the marginal probability of being infected by a neighbor). We also find conditions giving global upper bounds on the size and probability. The distributions leading to these bounds are network independent. In the special case of networks with high girth (locally tree-like), we are able to prove stronger results. In general, the probability and size of epidemics are maximal when the population is homogeneous and minimal when the variance of in- or out-transmissibility is maximal.

Sign in / Sign up

Export Citation Format

Share Document