Probabilistic automata (PAs) have been successfully applied in formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on probabilistic computation tree logic (PCTL) and its extension PCTL * . Various behavioral equivalences are proposed, as a powerful tool for abstraction and compositional minimization for PAs. Unfortunately, the equivalences are well-known to be sound, but not complete with respect to the logical equivalences induced by PCTL or PCTL * . The desire of a both sound and complete behavioral equivalence has been pointed out by Segala in [34], but remains open throughout the years. In this paper we introduce novel notions of strong bisimulation relations, which characterize PCTL and PCTL * exactly. We extend weak bisimulations that characterize PCTL and PCTL * without next operator, respectively. Further, we also extend the framework to simulation preorders. Thus, our paper bridges the gap between logical and behavioral equivalences and preorders in this setting.

Lingual mucosal grafts for anterior urethroplasty: a review

The objective of this study was to investigate the feasibility of tissue engineering of corpus cavernosal smooth muscle. Acellular corporal collagen matrices (ACCMs) were obtained from the penis of adult rabbits by a cell removal procedure. ACCMs were implanted into the back muscles of allogenic rabbits to investigate the resulting immunological reaction. Human umbilical artery smooth muscle cells (HUASMCs) were isolated from human umbilical arteries through explant techniques and expanded in vitro. Subsequently, third and fifth passage HUASMCs were seeded to ACCMs at a concentration of 30 x 10(6) cells/mL. Then, seeded ACCMs were implanted subcutaneously in athymic mice. The implants were retrieved at 10, 20 and 40 days after implantation. Histochemistry, immunohistochemistry and scanning electron microscopy were performed to analyse the morphological characteristics of the engineered tissues. Additionally, organ bath studies were performed to address the contractility of the engineered tissues. The decellularization process successfully extracted all cellular components while preserving the original collagen fibers. The immunological reaction to ACCMs consisted of only a transient nonspecific inflammatory response. Light and scanning electron microscopy demonstrated that HUASMCs extended onto the three-dimensional ACCMs scaffolds in vitro. Histological analyses of the explants from all time points demonstrated a progressive regeneration of smooth muscle, with structures very similar to native corpus cavernosum smooth muscle. The maximum contraction force induced by phenylephrine and electrical stimulation were 3.64 +/- 0.18 g/100 mg and 2.50 +/- 0.21 g/100 mg, respectively. Our study demonstrates that HUASMCs can be seeded on three-dimensional ACCM scaffolds and will develop tissues similar to that of the native corpus cavernosum smooth muscle.

No abstract

Abstract. MapReduce is a popular programming model for data parallel computation. In MapReduce, the reducer produces an output from a list of inputs. Due to the scheduling policy of the platform, the inputs may arrive at the reducers in different order. The commutativity problem of reducers asks if the output of a reducer is independent of the order of its inputs. Although the problem is undecidable in general, the MapReduce programs in practice are usually used for data analytics and thus require very simple control flow. By exploiting the simplicity, we propose a programming language for reducers where the commutativity problem is decidable. The main idea of the reducer language is to separate the control and data flow of programs and disallow arithmetic operations in the control flow. The decision procedure for the commutativity problem is obtained through a reduction to the equivalence problem of streaming numerical transducers (SNTs), a novel automata model over infinite alphabets introduced in this paper. The design of SNTs is inspired by streaming transducers (Alur and Cerny, POPL 2011). Nevertheless, the two models are intrinsically different since the outputs of SNTs are integers while those of streaming transducers are data words. The decidability of the equivalence of SNTs is achieved with an involved combinatorial analysis of the evolvement of the values of the integer variables during the runs of SNTs.