2,445 Hits in 3.6 sec

Page 5778 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
for probabilistic refusal testing.  ...  This testing equivalence is characterized by two fully abstract denotational semantics. The first of them is based on probabilistic refusal traces.  ... 

A Hierarchy of Equivalences for Probabilistic Processes [chapter]

Manuel Núñez, Luis Llana
2008 Lecture Notes in Computer Science  
These semantic frameworks cover from simple traces to probabilistic acceptance trees.  ...  We study several process equivalences on a probabilistic process algebra. First, we define an operational semantics. Afterwards we introduce the notion of passing a test with a probability.  ...  Depending on how these responses are analyzed, several testing semantics can be defined: May, must, refusal, fair, etc.  ... 
doi:10.1007/978-3-540-68855-6_17 fatcat:nkqwfm2dgjaudlfh34k7qh26la

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.  ...  In this paper we present some of the ideas appeared in the literature that could help to define appropriate formal frameworks for the specification of probabilistic processes.  ...  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

On the discriminating power of passivation and higher-order interaction

Marco Bernardo, Davide Sangiorgi, Valeria Vignudelli
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
The hierarchy of discriminating powers so obtained for RPLTSs is finer than that for LTSs.  ...  As first-order processes we consider both ordinary Labeled Transition Systems (LTSs) and Reactive Probabilistic Labeled Transition Systems (RPLTSs).  ...  For a similar reason, L CCS − ref coincides with the refusal testing equivalence of [23] and hence with ∼FTr.  ... 
doi:10.1145/2603088.2603113 dblp:conf/csl/BernardoSV14 fatcat:uk2kfupinfcl3btzyeygyz5fk4

Relating strong behavioral equivalences for processes with nondeterminism and probabilities

Marco Bernardo, Rocco De Nicola, Michele Loreti
2014 Theoretical Computer Science  
We present a comparison of behavioral equivalences for nondeterministic and probabilistic processes whose activities are all observable.  ...  In particular, we consider trace-based, testing, and bisimulation-based equivalences.  ...  Acknowledgment: We are very grateful to the anonymous referees for their helpful and constructive comments.  ... 
doi:10.1016/j.tcs.2014.03.001 fatcat:c3bggviwjbbrtmywugktwjvvba

Of Probabilistic wp and CSP—and Compositionality [chapter]

Carroll Morgan
2005 Lecture Notes in Computer Science  
A probabilistic sequential semantics for pGCL [31] is "inserted underneath" an existing but non-probabilistic link between action systems and CSP.  ...  We connect probabilistic Action Systems and probabilistic CSP, inducing healthiness conditions for the probabilistic traces, failures and divergences of the latter.  ...  at Orsay for their hospitality during the period March-June 2004.  ... 
doi:10.1007/11423348_12 fatcat:gkyobre2aje7loytzyk6elkaeq

Extending Refusal Testing by Stochastic Refusals for Testing Non-deterministic Systems [article]

Kenza Bouaroudj, Ilham Kitouni, Hiba Hachichi, Djamel-Eddine Saidouni
2012 arXiv   pre-print
In this context,test based on refusals is studied in theory and tools are effectively constructed.  ...  This paper addresses,a formal testing based on stochastic refusals graphs (SRG) in order to test stochastic system represented by maximality-based labeled stochastic transition systems (MLSTS).  ...  Stochastic Refusal Graph In this section we define a Stochastic Refusals Graph (SRG) as structure for testing stochastic non-deterministic systems.  ... 
arXiv:1211.2708v1 fatcat:ewn32jotgbfq3gccz2t2i4a3s4

Deontic Modals and Probabilities: One Theory to Rule Them All? [chapter]

Fabrizio Cariani
2016 Deontic Modality  
I offer a probabilistic premise semantics that explains all the data that create trouble for the rival theories. keywords: deontic modality, probability, information sensitivity, premise semantics, deontic  ...  This paper motivates and develops a novel semantic framework for deontic modals.  ...  It follows that what is tested is whether i r ∩ Selected(r) is a subset of A , which is just what a defender of a quantificational semantics for should would want to test for.  ... 
doi:10.1093/acprof:oso/9780198717928.003.0002 fatcat:krsgehntkzhp3k2ccbu3lgzvmq

More Anti-chain Based Refinement Checking [chapter]

Ting Wang, Songzheng Song, Jun Sun, Yang Liu, Jin Song Dong, Xinyu Wang, Shanping Li
2012 Lecture Notes in Computer Science  
Though applying anti-chain for probabilistic refinement checking is more complicated, we manage to show improvements in some cases.  ...  In this work, we study the problem of adopting anti-chain for stable failures refinement checking, failures-divergence refinement checking and probabilistic refine checking (i.e., a probabilistic implementation  ...  In the following, we extend Algorithm 1 for stable failures refinement checking. Given a set states x , we write refusals(x ) to denote {r | ∃ s ∈ x . r ∈ refusals(s)}.  ... 
doi:10.1007/978-3-642-34281-3_26 fatcat:g34wz4xe4zag7cxmzdy36eiuoq

Stepwise refinement of sequence diagrams with soft real-time constraints

Atle Refsdal, Ragnhild Kobro Runde, Ketil Stølen
2015 Journal of computer and system sciences (Print)  
Probabilities are often essential, in particular for capturing soft real-time constraints. It is also important to be able to specify systems at different levels of abstraction.  ...  The approach is supported by formal semantics and pragmatic refinement relations with mathematical properties that allow stepwise and modular development of specifications.  ...  We are grateful for the anonymous reviewers for a very thorough reading of the paper and for suggesting a number of improvements.  ... 
doi:10.1016/j.jcss.2015.03.003 fatcat:qqk2d7jphzghxhzzn333kdio3i

On Timed Models and Full Abstraction

Gavin Lowe, Joël Ouaknine
2006 Electronical Notes in Theoretical Computer Science  
In this paper we study a denotational model for a discrete-time version of CSP. We give a compositional semantics for the language.  ...  We briefly discuss the application of these models to the study of information flow in multi-level secure systems. 2 The model was originally called the refusal testing model ; we use the name refusal  ...  Acknowledgements We would like to thank Irek Ulidowski and the anonymous referees for useful comments about this work.  ... 
doi:10.1016/j.entcs.2005.11.070 fatcat:6ctsjpwjszcvfeg6dupt3cpxl4

Quantitative Analysis of Secure Information Flow via Probabilistic Semantics

Chunyan Mu, David Clark
2009 2009 International Conference on Availability, Reliability and Security  
In this paper, we quantify leakage in terms of information theory and incorporate this computation into probabilistic semantics.  ...  Our semantic functions provide information flow measurement for programs given secure inputs under any probability distribution.  ...  We also have used a probabilistic semantics to automate such analysis for leakage.  ... 
doi:10.1109/ares.2009.88 dblp:conf/IEEEares/MuC09 fatcat:dzcr5gmwzngnniwv7gwz4efu4y

Page 2428 of Mathematical Reviews Vol. , Issue 2004c [page]

2004 Mathematical Reviews  
(testing semantics), denotational and ax- iomatic.  ...  Furthermore, a process algebra is defined and applied to Petri boxes, together with a denotational, an operational, and a partial order semantics for such expressions.  ... 

Deriving tests from UML 2.0 sequence diagrams with neg and assert

Mass Soldal Lund, Ketil Stølen
2006 Proceedings of the 2006 international workshop on Automation of software test - AST '06  
In this paper we define an algorithm for deriving tests from UML 2.0 sequence diagrams based on the operational semantics for sequence diagrams defined in [13] .  ...  This modified algorithm is based on the standard semantic model of sequence diagrams and allows diagrams to contain the operators neg and assert. The derived tests are themselves sequence diagrams.  ...  Thanks to Judith Rossebø for giving comments on the paper.  ... 
doi:10.1145/1138929.1138934 dblp:conf/icse/LundS06 fatcat:u2cjeb4blbcuppgnhc5shuybjy

An Interval-based Abstraction for Quantifying Information Flow

Chunyan Mu, David Clark
2009 Electronical Notes in Theoretical Computer Science  
The size of this leakage, considered as a Shannon measure, may be automatically and exactly calculated via probabilistic semantics as we have shown in our earlier work.  ...  This approach works well for small programs with small state spaces. As the scale increases the calculation suffers from a form of state space explosion and the time complexity grows.  ...  Acknowledgement We thank Geoffrey Smith, Ton Coolen, and the anonymous reviewers for useful comments.  ... 
doi:10.1016/j.entcs.2009.10.009 fatcat:rxghsxunxrcunc7tcmx3mc242e
« Previous Showing results 1 — 15 out of 2,445 results