Transition Systems with Independence and Multi-Arcs

We extend the model of transition systems with independence in order to provide it with a feature relevant in the noninterleaving analysis of concurrent systems, namely multi-arcs. Moreover, we study the relationships between the category of transition systems with independence and multi-arcs and the category of labeled asynchronous transition systems, extending the results recently obtained by the authors for (simple) transition systems with independence (cf. Proc. CONCUR'96), and yielding a precise characterisation of transition systems with independence and multi-arcs in terms of (event-maximal, diamond-extensional) labeled asynchronous transition systems

MultiView : a methodology for supporting multiple view schemata in object-oriented databases

It has been widely recognized that object-oriented database (OODB) technology needs to be extended to provide a mechanism similar to views in relational database systems. We define an object-oriented view to be an arbitrarily complex virtual schema graph with possibly restructured generalization and decomposition hierarchies - rather than just one virtual class as has been proposed in the literature. In this paper, we propose a methodology, called MultiView, for supporting multiple such view schemata. MultiView breaks the schema design task into the following independent and well-defined subtasks: (1) the customization of type descriptions and object sets of existing classes by deriving virtual classes, (2) the integration of all derived classes into one consistent global schema graph, and (3) the definition of arbitrarily complex view schemata on this augmented global schema. For the first task of MultiView, we define a set of object algebra operators that can be used by the view definer for class customization. For the second task of MultiView, we propose an algorithm that automatically integrates these newly derived virtual classes into the global schema. We solve the third task of MultiView by first letting the view definer explicitly select the desired view classes from the global schema using a view definition language and then by automatically generating a view class hierarchy for these selected classes. In addition, we present algorithms that verify the closure property of a view and, if found to be incomplete, transform it into a closed, yet minimal, view. In this paper, we introduce the fundamental concept of view independence and show MultiView to be view independent. We also outline implementation techniques for realizing MultiView with existing OODB technology

A Free-Form Lensing Grid Solution for A1689 with New Mutiple Images

Hubble Space Telescope imaging of the galaxy cluster Abell 1689 has revealed an exceptional number of strongly lensed multiply-imaged galaxies, including high-redshift candidates. Previous studies have used this data to obtain the most detailed dark matter reconstructions of any galaxy cluster to date, resolving substructures ~25 kpc across. We examine Abell 1689 (hereafter, A1689) non-parametrically, combining strongly lensed images and weak distortions from wider field Subaru imaging, and we incorporate member galaxies to improve the lens solution. Strongly lensed galaxies are often locally affected by member galaxies, however, these perturbations cannot be recovered in grid based reconstructions because the lensing information is too sparse to resolve member galaxies. By adding luminosity-scaled member galaxy deflections to our smooth grid we can derive meaningful solutions with sufficient accuracy to permit the identification of our own strongly lensed images, so our model becomes self consistent. We identify 11 new multiply lensed system candidates and clarify previously ambiguous cases, in the deepest optical and NIR data to date from Hubble and Subaru. Our improved spatial resolution brings up new features not seen when the weak and strong lensing effects are used separately, including clumps and filamentary dark matter around the main halo. Our treatment means we can obtain an objective mass ratio between the cluster and galaxy components, for examining the extent of tidal stripping of the luminous member galaxies. We find a typical mass-to-light ratios of M/L_B = 21 inside the r<1 arcminute region that drops to M/L_B = 17 inside the r<40 arcsecond region. Our model independence means we can objectively evaluate the competitiveness of stacking cluster lenses for defining the geometric lensing-distance-redshift relation in a model independent way.Comment: 23 pages with 25 figures Replced with MNRAS submitted version. Some figures have been corrected and minor text edit

Petri net equivalence

Determining whether two Petri nets are equivalent is an interesting problem from both practical and theoretical standpoints. Although it is undecidable in the general case, for many interesting nets the equivalence problem is solvable. This paper explores, mostly from a theoretical point of view, some of the issues of Petri net equivalence, including both reachability sets and languages. Some new definitions of reachability set equivalence are described which allow the markings of some places to be treated identically or ignored, analogous to the Petri net languages in which multiple transitions may be labeled with the same symbol or with the empty string. The complexity of some decidable Petri net equivalence problems is analyzed

Sufficiency and necessity in reliability modeling

Limitations of current analytic techniques in estimating the reliability of life-critical electronics systems are discussed. A new framework for specification of recovery and fault-handling submodels is suggested, and is shown through several examples to provide substantially improved modeling accuracy and flexibility. Implementation of the new technique in an X-windows based system, XHARP, is also described. The implementation allows for an automated behavioral decomposition of full system models, heretofore unavailable in such tools

Solving Transition-Independent Multi-agent MDPs with Sparse Interactions (Extended version)

In cooperative multi-agent sequential decision making under uncertainty, agents must coordinate to find an optimal joint policy that maximises joint value. Typical algorithms exploit additive structure in the value function, but in the fully-observable multi-agent MDP setting (MMDP) such structure is not present. We propose a new optimal solver for transition-independent MMDPs, in which agents can only affect their own state but their reward depends on joint transitions. We represent these dependencies compactly in conditional return graphs (CRGs). Using CRGs the value of a joint policy and the bounds on partially specified joint policies can be efficiently computed. We propose CoRe, a novel branch-and-bound policy search algorithm building on CRGs. CoRe typically requires less runtime than the available alternatives and finds solutions to problems previously unsolvable

Log-based Evaluation of Label Splits for Process Models

Process mining techniques aim to extract insights in processes from event logs. One of the challenges in process mining is identifying interesting and meaningful event labels that contribute to a better understanding of the process. Our application area is mining data from smart homes for elderly, where the ultimate goal is to signal deviations from usual behavior and provide timely recommendations in order to extend the period of independent living. Extracting individual process models showing user behavior is an important instrument in achieving this goal. However, the interpretation of sensor data at an appropriate abstraction level is not straightforward. For example, a motion sensor in a bedroom can be triggered by tossing and turning in bed or by getting up. We try to derive the actual activity depending on the context (time, previous events, etc.). In this paper we introduce the notion of label refinements, which links more abstract event descriptions with their more refined counterparts. We present a statistical evaluation method to determine the usefulness of a label refinement for a given event log from a process perspective. Based on data from smart homes, we show how our statistical evaluation method for label refinements can be used in practice. Our method was able to select two label refinements out of a set of candidate label refinements that both had a positive effect on model precision.Comment: Paper accepted at the 20th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems, to appear in Procedia Computer Scienc