Adaptive workflow nets for grid computing

Existing grid applications commonly use workflows for the orchestration of grid services. Existing workflow models however suffer from the lack of adaptivity. In this paper we define Adaptive Grid Workflow nets (AGWF nets) appropriate for modeling grid workflows and allowing changes in the process structure as a response to triggering events/exceptions. Moreover, a recursion is allowed, which makes the model especially appropriate for a number of grid applications. We show that soundness can be verified for AGWF nets

Enhancing workflow-nets with data for trace completion

The growing adoption of IT-systems for modeling and executing (business) processes or services has thrust the scientific investigation towards techniques and tools which support more complex forms of process analysis. Many of them, such as conformance checking, process alignment, mining and enhancement, rely on complete observation of past (tracked and logged) executions. In many real cases, however, the lack of human or IT-support on all the steps of process execution, as well as information hiding and abstraction of model and data, result in incomplete log information of both data and activities. This paper tackles the issue of automatically repairing traces with missing information by notably considering not only activities but also data manipulated by them. Our technique recasts such a problem in a reachability problem and provides an encoding in an action language which allows to virtually use any state-of-the-art planning to return solutions

Model driven testing based on test history

We consider software systems consisting of a set of components running as a sequential process. We model such software systems as a special class of transition systems. The difference with existing approaches is that we propose a test procedure based on the structure of the model and the prior test history that can be used for exhaustive testing in an efficient way. On top of that we provide a statistical stopping rule, that is independent of the underlying way of walking through the system, which allows us to stop earlier with a certain statistical reliability.</p

Adaptive Workflow Nets for Grid Computing

Abstract. Existing grid applications commonly use workflows for the orchestration of grid services. Existing workflow models however suf-fer from the lack of adaptivity. In this paper we define Adaptive Grid Workflow nets (AGWF nets) appropriate for modeling grid workflows and allowing changes in the process structure as a response to trigger-ing events/exceptions. Moreover, a recursion is allowed, which makes the model especially appropriate for a number of grid applications. We show that soundness can be verified for AGWF nets

Ratios of BB and DD Meson Decay Constants in Relativistic Quark Model

We calculate the ratios of $B$ and $D$ meson decay constants by applying the variational method to the relativistic hamiltonian of the heavy meson. We adopt the Gaussian and hydrogen-type trial wave functions, and use six different potentials of the potential model. We obtain reliable results for the ratios, which are similar for different trial wave functions and different potentials. The obtained ratios show the deviation from the nonrelativistic scaling law, and they are in a pretty good agreement with the results of the Lattice calculations.Comment: 13 pages, 1 Postscript figur

Clinical Processes - The Killer Application for Constraint-Based Process Interactions?

For more than a decade, the interest in aligning information systems in a process-oriented way has been increasing. To enable operational support for business processes, the latter are usually specified in an imperative way. The resulting process models, however, tend to be too rigid to meet the flexibility demands of the actors involved. Declarative process modeling languages, in turn, provide a promising alternative in scenarios in which a high level of flexibility is demanded. In the scientific literature, declarative languages have been used for modeling rather simple processes or synthetic examples. However, to the best of our knowledge, they have not been used to model complex, real-world scenarios that comprise constraints going beyond control-flow. In this paper, we propose the use of a declarative language for modeling a sophisticated healthcare process scenario from the real world. The scenario is subject to complex temporal constraints and entails the need for coordinating the constraint-based interactions among the processes related to a patient treatment process. As demonstrated in this work, the selected real process scenario can be suitably modeled through a declarative approach.Ministerio de Economía y Competitividad TIN2016-76956-C3-2-RMinisterio de Economía y Competitividad TIN2015-71938-RED

Statistical certification of software systems

Abstract Common software release procedures based on statistical techniques try to optimise the trade-off between further testing costs and costs due to remaining errors. We propose new software release procedures where the aim is to certify that the software does not contain errors. The underlying model is a new discrete-time model similar to the JelinskiMoranda model. The decisions are based on a mix of classical and Bayesian approaches to sequential testing and do not require any assumption on the initial number of errors

Soundness-preserving refinements of service compositions

Soundness is one of the well-studied properties of processes; it denotes that a final state can be reached from every state that is reachable from the initial state. Soundness-preserving refinements are important for enabling the compositional design of systems. In this paper we concentrate on refinements of service compositions. We model service compositions using Petri nets, and consider specific pairs of places that belong to different services. Starting from a sound service composition, we show how to check whether such a pair of places can be refined by another sound service composition, so that soundness is preserved through the refinement

Magnetic Field Dependence of Macroscopic Quantum Tunneling and Coherence of Ferromagnetic Particle

We calculate the quantum tunneling rate of a ferromagnetic particle of $\sim 100 \AA$ diameter in a magnetic field of arbitrary angle. We consider the magnetocrystalline anisotropy with the biaxial symmetry and that with the tetragonal symmetry. Using the spin-coherent-state path integral, we obtain approximate analytic formulas of the tunneling rates in the small $\epsilon (=1- H/H_c)$-limit for the magnetic field normal to the easy axis ($\theta_H = \pi/2$), for the field opposite to the initial easy axis ($\theta_H = \pi$), and for the field at an angle between these two orientations ($\pi/2 << \theta_H << \pi$). In addition, we obtain numerically the tunneling rates for the biaxial symmetry in the full range of the angle $\theta_H$ of the magnetic field ($\pi/2 < \theta_H \leq \pi$), for the values of \epsilon =0.01 and 0.001.Comment: 25 pages of text (RevTex) and 4 figures (PostScript files), to be published in Phys. Rev.