Brand and Zaaropulo BZ83] introduced the model of communicating nite-state machines to represent a distributed system connected with FIFO channels. Several diierent communication protocols can be speciied with this simple model. In this paper we address the problem of automatically validating protocols by verifying properties such as well-formedness and absence of deadlock. Our method is based ...

We propose an improvement to session-types, introducing nested protocols, the possibility to call a subprotocol from a parent protocol. This feature adds expressiveness and modularity to the existing session-type theory, allowing arguments to be passed and enabling higher-order protocols definition. Our theory is introduced through a new type system for protocols handling subprotocol calls, and...

We discuss the use of logic for natural language (NL) processing, both as an internal query language and as a programming tool. Some extensions of standard predicate calculus are motivated by the first of these roles. A logical system including these extensions is informally described. It incorporates semantic as well as syntactic NL features, and its semantics in a given interpretation (or dat...

This paper introduces global session nets, an integration of multiparty session types (MPST) and Petri nets, for role-based choreographic specifications to verify distributed multiparty systems. The graphical representation of session nets enables more liberal combinations of branch, merge, fork and join patterns than the standard syntactic MPST. We use session net token dynamics to verify a fl...

The Gradual Learning Algorithm (Boersma 1997) is a constraint-ranking algorithm for learning optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and Smolensky (1993, 1996, 1998,2000), which initiated the learnability research program for Optimality T...

We present an effective technique to easily augment GHKM-style syntax-based machine translation systems (Galley et al., 2006) with phrase pairs that do not comply with any syntactic well-formedness constraints. Non-syntactic phrase pairs are distinguished from syntactic ones in order to avoid harming effects. We apply our technique in state-of-the-art string-totree and tree-to-string setups. Fo...

This research aims to examine the Englyn meter in poetry of Celtic language (Medieval Welsh) that requires poetic texts conform an abstract prosodic template. counting regulates phonological constituency on same metric level hierarchy rather than metrical verse (the line). In main types meters, milwr and penfyr, units each line are constrained with a certain number syllables rhyme final syllabl...

Abstract Collaborative cyber-physical systems are capable of forming networks at runtime to achieve goals that unachievable for individual systems. They do so by connecting each other and exchanging information helps them coordinate their behaviors shared goals. Their highly complex dependencies, however, difficult document using traditional goal modeling approaches. To help developers collabor...

Model Management with Relation Types Michalis Famelis Master of Science Graduate Department of Computer Science University of Toronto 2010 Software development in application domains where model-based techniques are employed faces challenges related to managing sets of inter-dependent models of various types. In such settings, capturing the semantic structure of sets of models, as well as being...

1. The Issue Of recent changes in linguistic theory, the shift from derivations to constraints is among the most substantive. Central to this is Optimality Theory (OT; Prince & Smolenksy 1993), which – unlike, e.g., Chomsky & Lasnik’s Filters or Pān. ini’s As.t.ādhyāȳı – claims that structural well-formedness (grammaticality) is enforced by sharply conflicting, mutually incompatible constraints...