An Algebra of Hierarchical Graphs and its Application to Structural Encoding

We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects. In particular, we propose the use of our graph formalism as a convenient way to describe configurations in process calculi equipped with inherently hierarchical features such as sessions, locations, transactions, membranes or ambients. The graph syntax can be seen as an intermediate representation language, that facilitates the encodings of algebraic specifications, since it provides primitives for nesting, name restriction and parallel composition. In addition, proving soundness and correctness of an encoding (i.e. proving that structurally equivalent processes are mapped to isomorphic graphs) becomes easier as it can be done by induction over the graph syntax

A Conceptual Model of Integrated Management System on the Organizational Excellence of Pubic Organization

Purpose: Integrated management system (IMS) assumes a crucial part in the administration of hierarchical issues and issues that connect with work whether formal or casual.   Theoretical Framework: The way that the IMS consolidates different administration frameworks that all alone guarantee positive result creates it a brilliant framework that can ensure authoritative greatness. Despite the fact that that is the situation, the contention has been how much might IMS at any point add to the accomplishment of hierarchical greatness? In that capacity, this calculated structure looks for feature the effect of IMS execution in associations.   Design/ Methodology/ Approach: IMS impact on hierarchical greatness was resolved in view of client center, development practices and association responsibility. Concerning IMS impact on association advancement, the perspectives that were given a lot of thought included process development, item development, innovation development and showcasing development.   Finding: Conversation on IMS was generally founded on how it connects with association development and greatness and its impact on authoritative culture and the most effective way of carrying out the IMS in an association. Speculation in light of finding out the degree of IMS effect on association development and greatness and how they interrelate.   Implications: The results of this study approves the calculated model that encourages mindfulness and execution of IMS in associations. Also, the result of this examination gives observational proof that associations who are zeroing in on greatness through IMS might make progress in the work.   Originality: This exploration applied review reports and calculated development model to quantify the degree of carrying out IMS, which incorporates the monetary, ecological, and security factors (for example ISO 9001 for quality administration frameworks (QMS), ISO 14001 for ecological administration frameworks (EMS) and ISO 45001 for Occupational Health and Safety the executives into a solitary measure to characterize the effect of feasible execution of IMS on hierarchical greatness enough.

Towards an Intelligent Tutor for Mathematical Proofs

Computer-supported learning is an increasingly important form of study since it allows for independent learning and individualized instruction. In this paper, we discuss a novel approach to developing an intelligent tutoring system for teaching textbook-style mathematical proofs. We characterize the particularities of the domain and discuss common ITS design models. Our approach is motivated by phenomena found in a corpus of tutorial dialogs that were collected in a Wizard-of-Oz experiment. We show how an intelligent tutor for textbook-style mathematical proofs can be built on top of an adapted assertion-level proof assistant by reusing representations and proof search strategies originally developed for automated and interactive theorem proving. The resulting prototype was successfully evaluated on a corpus of tutorial dialogs and yields good results.Comment: In Proceedings THedu'11, arXiv:1202.453

A logic for n-dimensional hierarchical refinement

Hierarchical transition systems provide a popular mathematical structure to represent state-based software applications in which different layers of abstraction are represented by inter-related state machines. The decomposition of high level states into inner sub-states, and of their transitions into inner sub-transitions is common refinement procedure adopted in a number of specification formalisms. This paper introduces a hybrid modal logic for k-layered transition systems, its first-order standard translation, a notion of bisimulation, and a modal invariance result. Layered and hierarchical notions of refinement are also discussed in this setting.Comment: In Proceedings Refine'15, arXiv:1606.0134

Recursion Aware Modeling and Discovery For Hierarchical Software Event Log Analysis (Extended)

This extended paper presents 1) a novel hierarchy and recursion extension to the process tree model; and 2) the first, recursion aware process model discovery technique that leverages hierarchical information in event logs, typically available for software systems. This technique allows us to analyze the operational processes of software systems under real-life conditions at multiple levels of granularity. The work can be positioned in-between reverse engineering and process mining. An implementation of the proposed approach is available as a ProM plugin. Experimental results based on real-life (software) event logs demonstrate the feasibility and usefulness of the approach and show the huge potential to speed up discovery by exploiting the available hierarchy.Comment: Extended version (14 pages total) of the paper Recursion Aware Modeling and Discovery For Hierarchical Software Event Log Analysis. This Technical Report version includes the guarantee proofs for the proposed discovery algorithm