Filters








4,398 Hits in 6.7 sec

Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language

Huibiao Zhu, Fan Yang, Jifeng He, Jonathan P. Bowen, Jeff W. Sanders, Shengchao Qin
2012 The Journal of Logic and Algebraic Programming  
Recently, the language PTSC has been proposed to integrate probability and time with shared-variable concurrency (Zhu et al. (2006 (Zhu et al. ( , 2009 ), where the operational semantics has been explored  ...  This paper investigates the link between the operational and algebraic semantics of PTSC, highlighting both its theoretical and practical aspects.  ...  Conclusions This paper has presented how an algebraic semantics links with an operational semantics for our proposed probabilistic language with time and shared-variable concurrency.  ... 
doi:10.1016/j.jlap.2011.06.003 fatcat:dvcj3cana5g6vbt3nnbqzcvjj4

Integrating Probability with Time and Shared-Variable Concurrency

Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan Bowen
2006 IEEE Software Engineering Workshop  
We formalize an operational semantics for such an integration.  ...  In this paper, we integrate probability, time and concurrency in one single model, where the concurrency feature is modelled using shared-variable based communication.  ...  Probabilistic Language PTSC In this paper we propose a probabilistic language PTSC (Probability, Time and Shared-variable Concurrency), which involves the integration of probability, time and shared-variable  ... 
doi:10.1109/sew.2006.22 dblp:conf/sew/ZhuQHB06 fatcat:hhlkb4z7e5ex3fgas3cp75hdxe

Denotational Semantics for a Probabilistic Timed Shared-Variable Language [chapter]

Huibiao Zhu, Jeff W. Sanders, Jifeng He, Shengchao Qin
2013 Lecture Notes in Computer Science  
We also explored its operational semantics, where a set of algebraic laws has been investigated via bisimulation. In this paper we explore the denotational semantics for our probabilistic language.  ...  It is challenging to formalize languages comprising all these features. We have proposed a language, which integrates probability with time and sharedvariable concurrency (called PTSC [19] ).  ...  For exploring the unifying of the semantics for PTSC, we have explored the link between operational semantics and algebraic semantics [20] .  ... 
doi:10.1007/978-3-642-35705-3_11 fatcat:4lko7enri5evfk4w3dijf7bbf4

PTSC: probability, time and shared-variable concurrency

Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P. Bowen
2009 Innovations in Systems and Software Engineering  
We formalize an operational semantics for such an integration.  ...  In this paper, we integrate probability, time and concurrency in one single model, where the concurrency feature is modelled using shared-variable-based communication.  ...  Section 2 presents our language equipped with probability, time and shared-variable concurrency. Section 3 is devoted to the operational semantics.  ... 
doi:10.1007/s11334-009-0100-9 fatcat:zp5o5ox56zd3dcentmto24o6oa

Probabilistic models for the guarded command language

He Jifeng, K. Seidel, A. McIver
1997 Science of Computer Programming  
The two models presented in this paper provide two different semantics for an extension of Dijkstra's language of guarded commands.  ...  The extended language has an additional operator, namely probabilistic choice, which makes it possible to express randomized algorithms.  ...  Acknowledgements The authors wish to acknowledge Tony Hoare, Carroll Morgan and Jeff Sanders for discussions and suggestions.  ... 
doi:10.1016/s0167-6423(96)00019-6 fatcat:b5gwvoip65f67jxv2xlthtppg4

A Distributed and Probabilistic Concurrent Constraint Programming Language [chapter]

Luca Bortolussi, Herbert Wiklicky
2005 Lecture Notes in Computer Science  
In addition, all this activities are embedded in a probabilistic scheme based on a discrete model of time, both locally and globally.  ...  In addition, the language is provided with a probabilistic semantic. Concurrent Constraint Programming was introduced in [17], and it is based on a computational paradigm founded on constraints.  ...  It is now a quite well established language, with its own operational [5] and denotational [4] semantic.  ... 
doi:10.1007/11562931_13 fatcat:2kmx2ttcprbwba3hfnmwrm3dpe

Probabilistic NetKAT [chapter]

Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, Alexandra Silva
2016 Lecture Notes in Computer Science  
This paper presents a new language for network programming based on a probabilistic semantics.  ...  Overall, the contributions of this paper are as follows: -We present the design of ProbNetKAT, the first language-based framework for specifying and verifying probabilistic network behavior.  ...  The authors wish to thank the members of the Cornell PLDG and DIKU COPLAS group for insightful discussions and helpful comments.  ... 
doi:10.1007/978-3-662-49498-1_12 fatcat:sii3ahs6ivd53d7m4zwmoehm64

Stochastic Process Semantics for Dynamical Grammar Syntax: An Overview [article]

Eric Mjolsness
2005 arXiv   pre-print
We define a class of probabilistic models in terms of an operator algebra of stochastic processes, and a representation for this class in terms of stochastic parameterized grammars.  ...  The operators are generators for the time-evolution of stochastic processes.  ...  Conclusion We have established a syntax and semantics for a probabilistic modeling language based on independent processes leading to events linked by a shared set of objects.  ... 
arXiv:cs/0511073v1 fatcat:ztfrqdsc5nayfjga5fi7citkka

A compositional modelling and analysis framework for stochastic hybrid systems

Ernst Moritz Hahn, Arnd Hartmanns, Holger Hermanns, Joost-Pieter Katoen
2012 Formal methods in system design  
MODEST is a high-level language inspired by classical process algebras, thus compositional modelling is an integral feature.  ...  We define the syntax and semantics of HMODEST and show that it is a conservative extension of MOD-EST that retains the compositional modelling approach.  ...  Acknowledgements The authors thank Pedro D'Argenio for discussions on the language design and Nicolás Wolovick (both from University of Cordoba, Argentina) for his support in the development of the concrete  ... 
doi:10.1007/s10703-012-0167-z fatcat:hm7rq6e6v5dlldavw7ncn7tewu

Probabilistic Linda-Based Coordination Languages [chapter]

Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
2005 Lecture Notes in Computer Science  
The main objective of such a study is to develop a semantic basis for a quantitative analysis of systems of interconnected or interacting components, which allows us to address not only the functional  ...  We review various approaches to introducing probabilistic or stochastic features in coordination languages.  ...  Similarly to the continuous time version of our pKLAIM, this time is determined by random variables which are exponentially distributed, so that the operational semantics of the language can be represented  ... 
doi:10.1007/11561163_6 fatcat:paq4lukxxrchhjwyqxa62pe7e4

Measure Transformer Semantics for Bayesian Machine Learning

Johannes Borgström, Andrew Gordon, Michael Greenberg, James Margetson, Jurgen Van Gael, Gilles Barthe
2013 Logical Methods in Computer Science  
The Bayesian approach to machine learning amounts to computing posterior distributions of random variables from a probabilistic model of how the variables are related (that is, a prior distribution) and  ...  As a foundation for this kind of programming, we propose a core functional calculus with primitives for sampling prior distributions and observing variables.  ...  Acknowledgements We gratefully acknowledge discussions with Ralf Herbrich, Tom Minka, and John Winn. Comments from Nikhil Swamy, Dimitrios Vytiniotis, and the anonymous reviewers were helpful.  ... 
doi:10.2168/lmcs-9(3:11)2013 fatcat:3w66pnpcvvedzf3yjda5ixwhom

Measure Transformer Semantics for Bayesian Machine Learning [chapter]

Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson, Jurgen Van Gael
2011 Lecture Notes in Computer Science  
The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (that is, a prior distribution) and  ...  As a foundation for this kind of programming, we propose a core functional calculus with primitives for sampling prior distributions and observing variables.  ...  Acknowledgements We gratefully acknowledge discussions with Ralf Herbrich, Tom Minka, and John Winn. Comments from Nikhil Swamy, Dimitrios Vytiniotis, and the anonymous reviewers were helpful.  ... 
doi:10.1007/978-3-642-19718-5_5 fatcat:kzg7mhdtgvhc7pahwc22ac3mcy

A UTP Semantics for Communicating Processes with Shared Variables [chapter]

Ling Shi, Yongxin Zhao, Yang Liu, Jun Sun, Jin Song Dong, Shengchao Qin
2013 Lecture Notes in Computer Science  
CSP# (Communicating Sequential Programs) is a modelling language designed for specifying concurrent systems by integrating CSP 1 -like compositional operators with sequential programs updating shared variables  ...  We further derive a closed semantics by focusing on special types of hybrid traces; this closed semantics can be linked with existing CSP# operational semantics.  ...  Acknowledgements The authors thank Jim Woodcock for insightful comments in the initial discussion.  ... 
doi:10.1007/978-3-642-41202-8_15 fatcat:r7qsqp5l2feithekv3fxsxkz74

Operator Algebras and the Operational Semantics of Probabilistic Languages

Alessandra Di Pierro, Herbert Wiklicky
2006 Electronical Notes in Theoretical Computer Science  
We show how to construct for a given probabilistic language a unique AF algebra A and how to represent the operational semantics of processes within this framework: finite computations correspond directly  ...  We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems.  ...  A Probabilistic Language and its Operator-algebraic Semantics We apply the approach described in the previous section to the definition of an operator semantics for a simple probabilistic language.  ... 
doi:10.1016/j.entcs.2006.04.029 fatcat:lzxcer3kgbdnvfwdrjsi5rv6py

MoDeST — A Modelling and Description Language for Stochastic Timed Systems [chapter]

Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter Katoen, Ric Klaren
2001 Lecture Notes in Computer Science  
Thus, MoDeST (i) covers a very broad spectrum of modelling concepts, (ii) possesses a rigid, process-algebra style semantics, and (iii) yet provides modern and flexible specification constructs.  ...  The language is influenced by popular and user-friendly specification languages such as Promela, and deals with compositionality in a light-weight process-algebra style.  ...  algebras, or appropriate extensions of labelled transition systems (such as timed and probabilistic automata [1, 31] ).  ... 
doi:10.1007/3-540-44804-7_6 fatcat:ojdvn4pcm5dy5pi3n4eam3ea4m
« Previous Showing results 1 — 15 out of 4,398 results