Symbolic Automata: The Toolkit

Abstract. The symbolic automata toolkit lifts classical automata anal-ysis to work modulo rich alphabet theories. It uses the power of state-of-the-art constraint solvers for automata analysis that is both expres-sive and efficient, even for automata over large finite alphabets. The toolkit supports analysis of finite symbolic automata and transducers over strings. It also handles transducers with registers. Constraint solving is used when composing and minimizing automata, and a much deeper and powerful integration is also obtained by internalizing automata as theories. The toolkit, freely available from Microsoft Research1, has re-cently been used in the context of web security for analysis of potentially malicious data over Unicode characters. Introduction. The distinguishing feature of the toolkit is the use and oper-ations with symbolic labels. This is unlike classical automata algorithms that mostly work assuming a finite alphabet. Adtantages of a symbolic representa-tion are examined in [4], where it is shown that the symbolic algorithms con

Reasoning about Communicating Agents in the Semantic Web

Abstract. In this article we interpret the Semantic Web and Web Service issues in the framework of multi-agent interoperating systems. We will advocate the application of results achieved in the research area of reasoning about actions and change by showing scenarios and techniques that could be applied.

Extended Computation Tree Logic

We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may determine the moments along a path that an until property may be fulfilled. We consider several classes of languages leading to logics with different expressive power and complexity, whose importance is motivated by their use in model checking, synthesis, abstract interpretation, etc. We show that even with context-free languages on the until operator the logic still allows for polynomial time model-checking despite the significant increase in expressive power. This makes the logic a promising candidate for applications in verification. In addition, we analyse the complexity of satisfiability and compare the expressive power of these logics to CTL* and extensions of PDL

Physical Processes in Star Formation

© 2020 Springer-Verlag. The final publication is available at Springer via https://doi.org/10.1007/s11214-020-00693-8.Star formation is a complex multi-scale phenomenon that is of significant importance for astrophysics in general. Stars and star formation are key pillars in observational astronomy from local star forming regions in the Milky Way up to high-redshift galaxies. From a theoretical perspective, star formation and feedback processes (radiation, winds, and supernovae) play a pivotal role in advancing our understanding of the physical processes at work, both individually and of their interactions. In this review we will give an overview of the main processes that are important for the understanding of star formation. We start with an observationally motivated view on star formation from a global perspective and outline the general paradigm of the life-cycle of molecular clouds, in which star formation is the key process to close the cycle. After that we focus on the thermal and chemical aspects in star forming regions, discuss turbulence and magnetic fields as well as gravitational forces. Finally, we review the most important stellar feedback mechanisms.Peer reviewedFinal Accepted Versio

Meta-analysis of type 2 Diabetes in African Americans Consortium

Type 2 diabetes (T2D) is more prevalent in African Americans than in Europeans. However, little is known about the genetic risk in African Americans despite the recent identification of more than 70 T2D loci primarily by genome-wide association studies (GWAS) in individuals of European ancestry. In order to investigate the genetic architecture of T2D in African Americans, the MEta-analysis of type 2 DIabetes in African Americans (MEDIA) Consortium examined 17 GWAS on T2D comprising 8,284 cases and 15,543 controls in African Americans in stage 1 analysis. Single nucleotide polymorphisms (SNPs) association analysis was conducted in each study under the additive model after adjustment for age, sex, study site, and principal components. Meta-analysis of approximately 2.6 million genotyped and imputed SNPs in all studies was conducted using an inverse variance-weighted fixed effect model. Replications were performed to follow up 21 loci in up to 6,061 cases and 5,483 controls in African Americans, and 8,130 cases and 38,987 controls of European ancestry. We identified three known loci (TCF7L2, HMGA2 and KCNQ1) and two novel loci (HLA-B and INS-IGF2) at genome-wide significance (4.15 × 10(-94)<P<5 × 10(-8), odds ratio (OR)  = 1.09 to 1.36). Fine-mapping revealed that 88 of 158 previously identified T2D or glucose homeostasis loci demonstrated nominal to highly significant association (2.2 × 10(-23) < locus-wide P<0.05). These novel and previously identified loci yielded a sibling relative risk of 1.19, explaining 17.5% of the phenotypic variance of T2D on the liability scale in African Americans. Overall, this study identified two novel susceptibility loci for T2D in African Americans. A substantial number of previously reported loci are transferable to African Americans after accounting for linkage disequilibrium, enabling fine mapping of causal variants in trans-ethnic meta-analysis studies.Peer reviewe

Beyond Message Sequence Graphs

We study the model-checking problem for classes of message sequence charts (MSCs) defined by two extensions of message sequence graphs (MSGs). These classes subsume the class of regular MSC languages

Total Eclipse at Koma

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)2761296-31