The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. The paths being considered have fixed start and end points on respectively the lower and right boundaries of a rectangle in the square lattice, each path can take only unit steps rightwards or upwards, and two different paths within a tuple are permitted to share...

Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stålmarck’s Method [16] or the Davis & Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates c...

We present two (closely-related) propositional probabilistic temporal logics based on temporal logics of branching time as introduced The first logic, PTLf, is interpreted over finite models, while the second logic, PTLb, which is an extension of the first one, is interpreted over infinite models with transition probabilities bounded away from O. The logic PTLf allows us to reason about finite-...

A recent paper of Bump, McNamara and Nakasuji introduced a factorial version of Tokuyama’s identity, expressing the partition function of six vertex model as the product of a t-deformed Vandermonde and a Schur function. Here we provide an extension of their result by exploiting the language of primed shifted tableaux, with its proof based on the use of non-interesecting lattice paths.

A recent paper of Bump, McNamara and Nakasuji introduced a factorial version of Tokuyama’s identity, expressing the partition function of six vertex model as the product of a t-deformed Vandermonde and a Schur function. Here we provide an extension of their result by exploiting the language of primed shifted tableaux, with its proof based on the use of non-intersecting lattice paths.