Filters








35,444 Hits in 4.9 sec

A Hierarchy of Equivalences for Probabilistic Processes [chapter]

Manuel Núñez, Luis Llana
2008 Lecture Notes in Computer Science  
Finally, we relate these nine equivalences and provide either alternative characterizations or fully abstract denotational semantics.  ...  For each of these families we define three predicates over processes and tests (may-pass, must-pass, passp ) which induce three equivalences.  ...  Hierarchy of testing equivalences for PPA generative model we have a fully abstract denotational semantics based on probabilistic acceptance trees [28] .  ... 
doi:10.1007/978-3-540-68855-6_17 fatcat:nkqwfm2dgjaudlfh34k7qh26la

Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes

Marco Bernardo
2009 Electronical Notes in Theoretical Computer Science  
In this paper we show that the logical characterizations of testing equivalences for fully nondeterministic processes, fully probabilistic processes, and fully Markovian processes without silent moves  ...  Unfortunately, this is not the case with the existing logical characterizations of the corresponding variants of testing equivalence, as they are based on different modal languages.  ...  Acknowledgement We thank Michele Loreti for some initial discussions on modal logics for testing equivalences.  ... 
doi:10.1016/j.entcs.2009.10.002 fatcat:jufmqn2c7rfzhllm4m3wvc6zse

Extending Backward Compatibility of Probabilistic Testing via Coherent Resolutions

Marco Bernardo
2020 Italian Conference on Theoretical Computer Science  
Therefore, it is only partially backward compatible with testing equivalences for fully nondeterministic processes and for fully probabilistic processes.  ...  Testing equivalence for processes featuring both nondeterminism and probabilities is not insensitive to the moment of occurrence of nondeterministic or probabilistic choices among identical actions.  ...  nondeterministic, and with the testing equivalence of [13] on fully probabilistic processes only if tests are restricted to be fully probabilistic.  ... 
dblp:conf/ictcs/000120 fatcat:2dad6lznrfeprnakzujnyms2gm

Acceptance trees for probabilistic processes [chapter]

Manuel Núñez, David Frutos, Luis Llana
1995 Lecture Notes in Computer Science  
Finally, we present a fully abstract denotational semantics based on acceptance trees.  ...  In this paper we study the extension of classical testing theory to a probabilistic process algebra.  ...  Smolka for his very useful comments on a draft version of this paper and for his warm reception when the rst author visited Stony Brook.  ... 
doi:10.1007/3-540-60218-6_18 fatcat:mhvywzm2qvdyvakqhe3ymmxuke

Testing preorders for probabilistic processes can be characterized by simulations

Bengt Jonsson, Wang Yi
2002 Theoretical Computer Science  
The preorder is based on a notion of testing, where reÿnement corresponds to an improvement in the "worst-case" behavior of a process.  ...  There are several preorders that serve as criteria for reÿnement of an abstract transition system to a more concrete one.  ...  Svante Janson at the Department of Mathematics, Uppsala University, contributed signiÿcantly in the application the Hahn-Banach theorem in the proof of the main theorem.  ... 
doi:10.1016/s0304-3975(01)00044-5 fatcat:nnk73oz2infnzodwxrrvgckpei

An Overview of Probabilistic Process Algebras and Their Equivalences [chapter]

Natalia López, Manuel Núñez
2004 Lecture Notes in Computer Science  
Thus, we will review some of the theories based on bisimulation and testing semantics.  ...  First, we will explain the different interpretations of the probabilistic information included in this kind of models.  ...  Acknowledgments The authors would like to thank the anonymous referees of this paper for the careful reading. Their very valuable comments have undoubtedly improved the quality of this survey.  ... 
doi:10.1007/978-3-540-24611-4_3 fatcat:cb5v35j7bbay3g6njscpafbm5i

Page 6455 of Mathematical Reviews Vol. , Issue 2004h [page]

2004 Mathematical Reviews  
A fully abstract denotational semantics based on probabilistic acceptance trees is given. Finally, a sound and com- plete axiomatization is presented.  ...  Three alternative views (operational, deno- tational, and axiomatic) of the may, must, and may-must testing semantics have been given.  ... 

A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems

MARCO BERNARDO, STEFANIA BOTTA
2008 Mathematical Structures in Computer Science  
In this paper we consider three different approaches to the definition of behavioral equivalences -bisimulation, testing, and trace -applied to three different classes of systems -nondeterministic, probabilistic  ...  In the probabilistic and Markovian cases we also address the issue of whether the probabilistic and temporal aspects should be treated in a local or global way and consequently whether the modal logic  ...  a fully abstract characterization of Markovian testing equivalence, which again is based on the canonical reactive tests.  ... 
doi:10.1017/s0960129507006408 fatcat:xlsxcpvinvfgdi7m4desn6htuq

Page 120 of American Society of Civil Engineers. Collected Journals Vol. 14, Issue 4 [page]

2001 American Society of Civil Engineers. Collected Journals  
Tryon’ and Animesh Dey’ ABSTRACT: This paper discusses research to develop a computer modeling technique to predict the statistical behavior of fatigue in fully lamellar TiAl.  ...  One such aspect of con- cern is the large scatter (variation) in the fatigue response of the TiAl material characterization test.  ... 

A Theory of Testing for Markovian Processes [chapter]

Marco Bernardo, Rance Cleaveland
2000 Lecture Notes in Computer Science  
A fully abstract characterization is developed to ease the task of establishing testing related relationships between Markovian processes.  ...  Our Markovian testing theory is shown to enjoy close connections with the classical testing theory of De Nicola-Hennessy and the probabilistic testing theory of Cleaveland-Smolka et al.  ...  Conclusion In this paper we have developed a testing theory for Markovian processes and we have provided a fully abstract characterization of it which simpli es the task of establishing preorder relationships  ... 
doi:10.1007/3-540-44618-4_23 fatcat:jxnvnxl7zrfmhn55kpvmghvtqm

Probabilistic exposure assessment of operator and residential exposure; a Canadian regulatory perspective

2001 Annals of Occupational Hygiene  
data to characterize input parameters, probabilistic assessments may be appropriate.  ...  An overview of the considerations central to selection of probabilistic versus deterministic approaches to assessment of operator and residential exposure are provided.  ...  Ideally, data generation should be structured to provide enough information to fully characterize the distribution, including its tails.  ... 
doi:10.1093/annhyg/45.suppl_1.s43 pmid:11290347 fatcat:6454iqarmfdtndouctbfg2nthu

Page 7287 of Mathematical Reviews Vol. , Issue 98K [page]

1998 Mathematical Reviews  
They show that the map taking each automaton to its behavior respects composition, and that this notion of behavior ts fully abstract with respect to probabilistic testing.  ...  A new characterization of sober spaces in terms of completely distributive lattices is given.  ... 

Page 8773 of Mathematical Reviews Vol. , Issue 99m [page]

1999 Mathematical Reviews  
J. (4-BIRM-SC; Birmingham) A fully abstract metric-space denotational semantics for reactive probabilistic processes.  ...  of the reactive probabilistic transition systems introduced by K.  ... 

Basic Mechanisms of Numerical Processing: Cross-Modal Number Comparisons and Symbolic Versus Nonsymbolic Numerosity in the Intraparietal Sulcus

C. F. Chick
2014 Journal of Neuroscience  
For example, an accumulator-comparator model of the IPS, as demonstrated in sensory and probabilistic decision making, may also characterize the role of the IPS in numerosity judgment.  ...  to be precisely characterized.  ... 
doi:10.1523/jneurosci.4771-13.2014 pmid:24478340 pmcid:PMC6827579 fatcat:sxf4ytmkefdy3hlecvcxo7kfua

THE INFLUENCE OF MACHINED TOPOGRAPHY ON THE HCF BEHAVIOUR OF THE Al7050 ALLOY

F. Abroug, E. Pessard, G. Germain, F. Morel, E. Chové
2018 Procedia Engineering  
A vast experimental campaign under fully reversed plane bending loads containing different surface states has been undertaken to characterize the effect of the surface topography on the fatigue behaviour  ...  This is an author-deposited version published in: https://sam.ensam.eu Handle ID Abstract The aim of this study is to identify the impact of High Speed Machining defects on the fatigue behaviour of the  ...  Acknowledgements This work was carried out within the FUI QUAUSI project with the support of industrial (Dassault Aviation, Europe Technologie, Figeac Aéro, Mecachrome, Spring Technologie, Precise, GEBE2  ... 
doi:10.1016/j.proeng.2018.02.057 fatcat:oqo25vxi45fu3n4itdwlc5qozy
« Previous Showing results 1 — 15 out of 35,444 results