A System for Deduction-based Formal Verification of Workflow-oriented Software Models

The work concerns formal verification of workflow-oriented software models using deductive approach. The formal correctness of a model's behaviour is considered. Manually building logical specifications, which are considered as a set of temporal logic formulas, seems to be the significant obstacle for an inexperienced user when applying the deductive approach. A system, and its architecture, for the deduction-based verification of workflow-oriented models is proposed. The process of inference is based on the semantic tableaux method which has some advantages when compared to traditional deduction strategies. The algorithm for an automatic generation of logical specifications is proposed. The generation procedure is based on the predefined workflow patterns for BPMN, which is a standard and dominant notation for the modeling of business processes. The main idea for the approach is to consider patterns, defined in terms of temporal logic,as a kind of (logical) primitives which enable the transformation of models to temporal logic formulas constituting a logical specification. Automation of the generation process is crucial for bridging the gap between intuitiveness of the deductive reasoning and the difficulty of its practical application in the case when logical specifications are built manually. This approach has gone some way towards supporting, hopefully enhancing our understanding of, the deduction-based formal verification of workflow-oriented models.Comment: International Journal of Applied Mathematics and Computer Scienc

A New Rational Algorithm for View Updating in Relational Databases

The dynamics of belief and knowledge is one of the major components of any autonomous system that should be able to incorporate new pieces of information. In order to apply the rationality result of belief dynamics theory to various practical problems, it should be generalized in two respects: first it should allow a certain part of belief to be declared as immutable; and second, the belief state need not be deductively closed. Such a generalization of belief dynamics, referred to as base dynamics, is presented in this paper, along with the concept of a generalized revision algorithm for knowledge bases (Horn or Horn logic with stratified negation). We show that knowledge base dynamics has an interesting connection with kernel change via hitting set and abduction. In this paper, we show how techniques from disjunctive logic programming can be used for efficient (deductive) database updates. The key idea is to transform the given database together with the update request into a disjunctive (datalog) logic program and apply disjunctive techniques (such as minimal model reasoning) to solve the original update problem. The approach extends and integrates standard techniques for efficient query answering and integrity checking. The generation of a hitting set is carried out through a hyper tableaux calculus and magic set that is focused on the goal of minimality.Comment: arXiv admin note: substantial text overlap with arXiv:1301.515

Dissecting Visual Analytics: Comparing Frameworks for Interpreting and Modelling Observed Visual Analytics Behavior

This paper provides an empirical, comparative exploration of the role of analytic frameworks in interpreting and modelling visual analytics behavior through data gathered in observational studies. The crucial research on understanding the complex and multi-faceted interplay between visual analytics tools and their users is often done through controlled or naturalistic observations of analysts engaging in the visual analytic process, followed by the interpretation of the observation data. The researchers in Human Computer Interaction and Cognitive Sciences have long used structured analytic frameworks for such analyses, where a guiding set of principles and questions direct attention to relevant aspects of the studied behavior, eventually leading to more complete and consistent analyses. Such frameworks are rarely applied in the visualization domain however, and information about how to apply them and their benefits is scarce. With this paper, we contribute a comparative account, grounded in empirical data collected in a user study with 10 participants using Tableau to analyze domain-specific data, of the types of insights we can glean from interpreting observational data using three different frameworks: Joint Action Theory, Distributed Cognition, and Situated Cognition

Serious Game Design Using MDA and Bloom’s Taxonomy

The field of Serious Games (SG) studies the use of games as a learning tool and it has been in existence for over forty years. During this period the primary focus of the field has been designing systems to evaluate the educational efficacy of existing games. This translates to a lack of systems designed to aid in the creation of serious games, but this does not have to remain an issue. The rise in popularity of games means that there is no shortage of ideas on how to methodically create them for commercial production which can just as easily be applied to SG creation. However, showing a clear linkage between a game’s components and its learning objectives is a primary difficulty. Created by Hunicke, LeBlanc, and Zubek, the Mechanics Dynamics Aesthetics (MDA) methodology is an understandable and robust construct for creating commercial games using mechanics to produce an intended level of aesthetic appreciation from its consumers. However, an educational Serious Game (SG) must not only be fun, but through experience it must convey the intended learning objectives to its players. This thesis explores utilizing the MDA methodology, with Bloom’s taxonomy, to create and evaluate a game to meet two learning objectives for a Cyber focused class. The created game CyComEx, was designed to teach cyber students to identify tradeoffs between security and mission execution, and to explain how policies can impact cyber mission areas. The game was evaluated to have conveyed these objectives during a playthrough and that it was sufficiently enjoyable to students participating in this case study

Synthetizing Qualitative (Logical) Patterns for Pedestrian Simulation from Data

This work introduces a (qualitative) data-driven framework to extract patterns of pedestrian behaviour and synthesize Agent-Based Models. The idea consists in obtaining a rule-based model of pedestrian behaviour by means of automated methods from data mining. In order to extract qualitative rules from data, a mathematical theory called Formal Concept Analysis (FCA) is used. FCA also provides tools for implicational reasoning, which facilitates the design of qualitative simulations from both, observations and other models of pedestrian mobility. The robustness of the method on a general agent-based setting of movable agents within a grid is shown.Ministerio de Economía y Competitividad TIN2013-41086-