We study the behavioural theory of a higher-order distributed calculus with private names and locations that can be passivated. For this language, we present a novel Labelled Transition System where higherorder inputs are symbolic agents that can perform a limited number of transitions, capturing the nature of passivation. Standard first-order weak bisimulation over this LTS coincides with cont...

We study the problem of characterizing contextual equivalence in higher-orderlanguages with passivation. To overcome the difficulties arising in the proofof congruence of candidate bisimilarities, we introduce a new form of labelledtransition semantics together with its associated notion of bisimulation, whichwe call complementary semantics. Complementary semantics allows to...

In many Discrete-Event Systems (DES) both state and event information are of importance to the systems designer. Logics such as Ostroff’s RTTL allow for the specification and verification of a system’s state-event behavior. To make realistic problems amenable to analysis, a designer must typically decompose the system into subsystems (modules) and use algebraic abstraction (quotient systems) to...

The article deals with the problem of proving observational equivalence for the class of computational processes called processes with message passing. These processes can execute actions of the following forms: sending or receiving of messages, checking logical conditions and updating values of internal variables of processes. Our main result is a theorem that reduces the problem of proving ob...

1 Language 3 1.1 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Dynamic Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Static Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Contextual Equivalence . . . . . . . . . . . . . . ....

Random matching is often used in economic models as a means of introducing uncertainty in sequential decision problems. We show that random matching processes that satisfy standard proportionality laws are not unique. We give conditions on the payo¤s and transitions functions of sequential decision models that insure that the models are robust to the non-uniqueness of the matching process. Unde...

An analytic function method is applied to illustrate Geweke (2010)’s three econometric interpretations for a generic rational expectations (RE) model. This makes the model’s cross-equation restrictions imposed by each RE econometric interpretation explicit, formal, and simple. It is shown that the degree of identification on the deep parameters is inversely related to the strength of underlying...

One 9-year-old child was taught conditional discriminations between dictated names in Spanish and their corresponding pictures across three stimulus sets while her 10-year-old brother observed. Posttests revealed the emergence of symmetry relations in the form of oral naming skills by both children.

We study identification in a class of linear rational expectations models. For any given exactly identified model, we provide an algorithm that generates a class of equivalent models that have the same reduced form. We use our algorithm to show that a model proposed by Jess Benhabib and Roger Farmer is observationally equivalent to the standard new-Keynesian model when observed over a single po...

We show that call-by-need is observationally equivalent to weak-head needed reduction. The proof of this result uses a semantical argument based on a (non-idempotent) intersection type system called $\mathcal{V}$. Interestingly, system $\mathcal{V}$ also allows to syntactically identify all the weak-head needed redexes of a term.