WADT2008

Abstract: We use Abstract State Machines to develop an extensible semantical framework for business process modeling notations. The approach is illustrated by defining a high-level interpreter for business process diagrams written in the OMG standard BPMN. We show, by presenting various solutions of the so-called OR-join problem, how ASM models for BPMN diagrams can be used for their accurate analysis.

This is joint work with B. Thalheim and part of the Humboldt Research Award project, hosted by the Chair for Information Systems Engineering at the Computer Science Department of the University of Kiel/Germany.

Abstract: Chemical and biochemical systems are described as collectives of interacting stochastic automata: each automaton represents a molecule that undergoes state transitions. This framework constitutes an artificial biochemistry, where automata interact by the equivalent of the law of mass action. We analyze systems and networks, both by stochastic simulation and by ordinary differential equations, and relate the two approaches.

Abstract: Service-oriented computing is dynamic. There may be many possible service instances available for binding, leading to uncertainty about where service requests will execute. We present a novel Markovian process calculus which allows the formal expression of uncertainty about binding as found in service-oriented computing. We show how to compute meaningful quantitative information about the quality of service provided in such a setting. These numerical results can be used to allow the expression of accurate service-level agreements about service-oriented computing.