TLAPS, the TLA proof system, is a platform for the development and mechanical verification of TLA proofs. The TLA proof language is declarative, and understanding proofs requires little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of any verification tool or strategy. Proofs are written in ...

Mastic asphalt (MA) has been recognized as one of the most deformation-resistant and thus durable materials for bridge pavement. The performance properties MA are highly dependent on physical rheological binder applied in mixture. To modify to obtain expected mixture, Trinidad Lake Asphalt (TLA) is often applied. In this study, TLA-modified binders be used mastic pavement systems were evaluated...

In this article we provide a refmed analysis of learning in finite parameter spaces using the Triggering Learning Algorithm (TLA) of Gibson and Wexler (1994). We show that the behavior of the TLA can be modeled exactly as a Markov chain. This Markov model allows us to (1) describe formally the conditions for learnability in such spaces, (2) uncover problematic states in addition to the local ma...

The thymus leukemia (TL) antigens, encoded by class I genes in the Tla subregion of the major histocompatibility complex (MHC), are cell surface molecules expressed on thymocytes of certain strains of mice and on certain T-cell leukemias. In order to study the fine structure and interrelationships of genes of the TM subregion, a Tla-specific probe was isolated from the TL-encoding T13C gene ofB...

We investigate the use of a TLA speci cation for modeling and proving parallelization within an object-oriented language. Our model is based on Ei el= a parallel extension of Ei el, where sequential programs can be reused for parallel or concurrent programming with very minor changes. We want to prove that both versions of a given program (sequential and parallel) are equivalent with respect to...

RÉSUMÉ : Control Theory researchers have been using DEVS models to formalize discrete event systems for a long time (Zeigler 1976) but, despite such systems are one of the main targets of Software Engineers, the DEVS formalism has not been used and it is hardly known by the formal methods community of Computer Science. This paper is a second attempt to close the gap between these communities by...

We report on an investigation of inter-consonantal intervals (ICIs) in sequences of two, three and four stops within and across word boundaries in Tripolitanian Libyan Arabic (TLA). This variety of Arabic has been described as allowing vowel epenthesis in all consonant clusters [7]. Our investigation was motivated by the question of whether some of the ‘epenthetic vowels’ of TLA are better char...

Pastry is an algorithm that provides a scalable distributed hash table over an underlying P2P network. Several implementations of Pastry are available and have been applied in practice, but no attempt has so far been made to formally describe the algorithm or to verify its properties. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to ch...