2,244 research outputs found
Calibrating Generative Models: The Probabilistic Chomsky-SchĂĽtzenberger Hierarchy
A probabilistic Chomsky–Schützenberger hierarchy of grammars is introduced and studied, with the aim of understanding the expressive power of generative models. We offer characterizations of the distributions definable at each level of the hierarchy, including probabilistic regular, context-free, (linear) indexed, context-sensitive, and unrestricted grammars, each corresponding to familiar probabilistic machine classes. Special attention is given to distributions on (unary notations for) positive integers. Unlike in the classical case where the "semi-linear" languages all collapse into the regular languages, using analytic tools adapted from the classical setting we show there is no collapse in the probabilistic hierarchy: more distributions become definable at each level. We also address related issues such as closure under probabilistic conditioning
A Rewriting Based Model for Probabilistic Distributed Object Systems
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The nondeterminism provides an abstraction over scheduling, network delays, failures and randomization. However a probabilistic model can capture these sources of nondeterminism more precisely and enable statistical analysis, simulations and reasoning. We have developed a general semantic framework for probabilistic systems using probabilistic rewriting. Our framework also allows nondeterminism in the system. In this paper, we briefly describe the framework and its application to concurrent object based systems such as actors. We also identify a su#ciently expressive fragment of the general framework and describe its implementation. The concepts are illustrated by a simple client-server example
08171 Abstracts Collection -- Beyond the Finite: New Challenges in Verification and Semistructured Data
From 20.04. to 25.04.2008, the Dagstuhl Seminar 08171 ``Beyond the Finite: New Challenges in Verification and Semistructured Data\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Twenty years of rewriting logic
AbstractRewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems
A Rewriting Logic Approach to Stochastic and Spatial Constraint System Specification and Verification
This paper addresses the issue of specifying, simulating, and verifying
reactive systems in rewriting logic. It presents an executable semantics for
probabilistic, timed, and spatial concurrent constraint programming ---here
called stochastic and spatial concurrent constraint systems (SSCC)--- in the
rewriting logic semantic framework. The approach is based on an enhanced and
generalized model of concurrent constraint programming (CCP) where
computational hierarchical spaces can be assigned to belong to agents. The
executable semantics faithfully represents and operationally captures the
highly concurrent nature, uncertain behavior, and spatial and epistemic
characteristics of reactive systems with flow of information. In SSCC, timing
attributes ---represented by stochastic duration--- can be associated to
processes, and exclusive and independent probabilistic choice is also
supported. SMT solving technology, available from the Maude system, is used to
realize the underlying constraint system of SSCC with quantifier-free formulas
over integers and reals. This results in a fully executable real-time symbolic
specification that can be used for quantitative analysis in the form of
statistical model checking. The main features and capabilities of SSCC are
illustrated with examples throughout the paper. This contribution is part of a
larger research effort aimed at making available formal analysis techniques and
tools, mathematically founded on the CCP approach, to the research community.Comment: arXiv admin note: text overlap with arXiv:1805.0743
Modelling Probabilistic Wireless Networks
We propose a process calculus to model high level wireless systems, where the
topology of a network is described by a digraph. The calculus enjoys features
which are proper of wireless networks, namely broadcast communication and
probabilistic behaviour. We first focus on the problem of composing wireless
networks, then we present a compositional theory based on a probabilistic
generalisation of the well known may-testing and must-testing pre- orders.
Also, we define an extensional semantics for our calculus, which will be used
to define both simulation and deadlock simulation preorders for wireless
networks. We prove that our simulation preorder is sound with respect to the
may-testing preorder; similarly, the deadlock simulation pre- order is sound
with respect to the must-testing preorder, for a large class of networks. We
also provide a counterexample showing that completeness of the simulation
preorder, with respect to the may testing one, does not hold. We conclude the
paper with an application of our theory to probabilistic routing protocols
- …