This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice. The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributions as domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.

Form-based applications range from simple web shops to complex enterprise resource planning systems. Draheim and Weber adapt well-established basic modeling techniques in a novel way to achieve a modeling framework optimized for this broad application domain. They introduce new modeling artifacts, such as page diagrams and form storyboards, and separate dialogue patterns to allow for reuse. In their implementation they have developed new constructs such as typed server pages, and tools for forward and reverse engineering of presentation layers. The methodology is explained using an online bookshop as a running example in which the user can experience the modeling concepts in action.

The combination of theoretical achievements and hands-on practical advice and tools makes this book a reference work for both researchers in the areas of software architectures and submit-response style user interfaces, and professionals designing and developing such applications. More information and additional material is also available online.

Currently, we see a variety of tools and techniques for specifying and implementing business processes. The problem is that there are still gaps and tensions between the different disciplines needed to improve business process execution and improvement in enterprises. Business process modeling, workflow execution and application programming are examples of disciplines that are hosted by different communities and that emerged separately from each other. In particular, concepts have not yet been fully elaborated at the system analysis level. Therefore, practitioners are faced again and again with similar questions in concrete business process projects: Which decomposition mechanism to use? How to find the correct granularity for business process activities? Which implementing technology is the optimal one in a given situation? This work offers an approach to the systematization of the field. The methodology used is explicitly not a comparative analysis of existing tools and techniques - although a review of existing tools is an essential basis for the considerations in the book. Rather, the book tries to provide a landscape of rationales and concepts in business processes with a discussion of alternatives.

This book provides a frequentist semantics for conditionalization on partially known events, which is given as a straightforward generalization of classical conditional probability via so-called probability testbeds. It analyzes the resulting partial conditionalization, called frequentist partial (F.P.) conditionalization, from different angles, i.e., with respect to partitions, segmentation, independence, and chaining. It turns out that F.P. conditionalization meets and generalizes Jeffrey conditionalization, i.e., from partitions to arbitrary collections of events, opening it for reassessment and a range of potential applications. A counterpart of Jeffrey's rule for the case of independence holds in our frequentist semantics. This result is compared to Jeffrey's commutative chaining of independent updates. The postulate of Jeffrey's probability kinematics, which is rooted in the subjectivism of Frank P. Ramsey, is found to be a consequence in our frequentist semantics. This way the book creates a link between the Kolmogorov system of probability and one of the important Bayesian frameworks. Furthermore, it shows a preservation result for conditional probabilities under the full update range and compares F.P. semantics with an operational semantics of classical conditional probability in terms of so-called conditional events. Lastly, it looks at the subjectivist notion of desirabilities and proposes a more fine-grained analysis of desirabilities a posteriori. This book appeals to researchers who are involved in any kind of knowledge processing systems. F.P. conditionalization is a straightforward, fundamental concept that fits human intuition, and is systematically linked to one of the important Bayesian frameworks. As such, the book is interesting for anybody investigating the semantics of reasoning systems.

Currently, we see a variety of tools and techniques for specifying and implementing business processes. The problem is that there are still gaps and tensions between the different disciplines needed to improve business process execution and improvement in enterprises. Business process modeling, workflow execution and application programming are examples of disciplines that are hosted by different communities and that emerged separately from each other. In particular, concepts have not yet been fully elaborated at the system analysis level. Therefore, practitioners are faced again and again with similar questions in concrete business process projects: Which decomposition mechanism to use? How to find the correct granularity for business process activities? Which implementing technology is the optimal one in a given situation? This work offers an approach to the systematization of the field. The methodology used is explicitly not a comparative analysis of existing tools and techniques - although a review of existing tools is an essential basis for the considerations in the book. Rather, the book tries to provide a landscape of rationales and concepts in business processes with a discussion of alternatives.

Form-based applications range from simple web shops to complex enterprise resource planning systems. Draheim and Weber adapt well-established basic modeling techniques in a novel way to achieve a modeling framework optimized for this broad application domain. They introduce new modeling artifacts, such as page diagrams and form storyboards, and separate dialogue patterns to allow for reuse. In their implementation they have developed new constructs such as typed server pages, and tools for forward and reverse engineering of presentation layers. The methodology is explained using an online bookshop as a running example in which the user can experience the modeling concepts in action.

The combination of theoretical achievements and hands-on practical advice and tools makes this book a reference work for both researchers in the areas of software architectures and submit-response style user interfaces, and professionals designing and developing such applications. More information and additional material is also available online.

This book constitutes the thoroughly refereed postproceedings of the 2nd International Conference on Trends in Enterprise Application Architecture, TEAA 2006, held in Berlin, Germany, November 29 - December 1, 2006.

The 24 revised full papers presented together with 1 invited talk were carefully reviewed and selected from numerous submissions for inclusion in the book. Their common purpose is to identify problems or issues in enterprise application architecture and propose and evaluate a solution. Topics of interest are model driven architecture, enterprise development environments, service oriented architecture, data integration, sizing and cost estimation, performance benchmarking, mobile workforce access, multi-channel architecture, autonomous computing, enterprise grid computing, load balancing, and enterprise component platforms.

This book constitutes the thoroughly refereed postproceedings of the International Workshop on Trends in Enterprise Application Architecture, TEAA 2005, held in Trondheim, Norway in August 2005 as satellite event of the 31st International Conference on Very Large Data Bases, VLDB 2005. The 10 revised full papers presented together with the abstract of the keynote lecture were carefully reviewed and selected from numerous submissions for inclusion in the book.

This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice. The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributions as domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.