This paper presents an extension of the automatic protocol verifier ProVerif in order to prove more observational equivalences. ProVerif can prove observational equivalence between processes that have the same structure but differ by the messages they contain. In order to extend the class of equivalences that ProVerif handles, we extend the language of terms by defining more functions (destruct...

The possibility of non-constant discounting is important in environmental and resource management problems where current decisions affect welfare in the far-distant future, as with climate change. The difficulty of analyzing models with non-constant discounting limits their application. We describe and provide software to implement an algorithm to numerically obtain a Markov Perfect Equilibrium...

In the ubiquitous presence of linear resources in quantum computation, program equivalence in linear contexts, where programs are used or executed once, is more important than in the classical setting. We introduce a linear contextual equivalence and two notions of bisimilarity, a state-based and a distribution-based, as proof techniques for reasoning about higher-order quantum programs. Both n...

The basic structural time series model has been designed for the modelling and forecasting of seasonal economic time series. In this paper we explore a generalisation of the basic structural time series model in which the time-varying trigonometric terms associated with different seasonal frequencies have different variances for their disturbances. The contribution of the paper is two-fold. The...

We present a sound and complete compositional semantics, structured around certain abstractions of proof nets, for proof-search computation in a linear logic-based language. The model captures the interaction of agents in terms of the actions they engage into and of the dynamic creation of names. The model is adequate for reasoning about a notion of operational equivalence. We will also suggest...

We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we do not produce the recursive types via the usual inverse limits constructions we have it for free by working directly with the operational semantics. By extending type expressions to endofunctors on a ‘syntactic’ categ...

It can be shown that certain kinds of classical deterministic descriptions and indeterministic descriptions are observationally equivalent. In these cases there is a choice between deterministic and indeterministic descriptions. Therefore, the question arises of which description, if any, is preferable relative to evidence. This paper looks at the main argument in the literature (by Winnie, 199...

Background. Transportation settings such as bus stops and train station platforms are increasingly the target for new smokefree legislation. Relevant issues include secondhand smoke exposure, nuisance, litter, fire risks and the normalization of smoking. We therefore aimed to pilot study aspects of smoking behavior and butt disposal at bus stops. Methods. Systematic observation of smoking and b...

Motivated by the question whether sound and expressive applicative similarities for program calculi with should-convergence exist, this paper investigates expressive applicative similarities for the untyped call-by-value lambda-calculus extended with McCarthy’s ambiguous choice operator amb. Soundness of the applicative similarities w.r.t. contextual equivalence based on mayand should-convergen...

In the literature one can distinguish two main approaches to the definition of observational semantics of algebraic specifications. On one hand, observational semantics is defined using a notion of observational satisfaction for the axioms of a specification and on the other hand one can define observational semantics of a specification by abstraction with respect to an observational equivalenc...