New Field, Old Practices: Promises and Challenges of Public History

Although public history is becoming increasingly international, the field remains difficult to define and subject to some criticism. Based on sometimes long-established public practices, public history displays new approaches to audiences, collaboration and authority in history production. This article provides an overview of public history, its various definitions and historiography, and discusses some of the main criticisms of the field. Public history is compared to a tree of knowledge whose parts (roots, trunk, branches and leaves) represent the many collaborative and interconnected stages in the field. Defining public history as a systemic process (tree) demonstrates the need for collaboration between the different actors – may they be trained historians or not – and aim to focus on the role they play in the overall process. The future of international public history will involve balancing practice-based approaches with more theoretical discussions on the role of trained historians, audiences and different uses of the past.

Audit Pengelolaan Sekolah Menggunakan Proses Mining

Tujuan dari pembuatan paper ini adalah untuk melakukan audit pengelolaan sekolah dengan menggunakan metode process mining dan memanfaatkan aplikasi RapidProM. Data yang digunakan dalam audit pengelolaan sekolah ini merupakan data primer yang diperoleh dari observasi dan dokumentasi di SMAN 1 Tanjung Jabung Timur, kemudian diproses dengan menerapkan metode process mining. Dengan adanya penelitian ini diharapkan dapat melakukan pengelolaan organisasi yang ada di sekolah, sehingga pengelolaan organisasi di sekolah akan lebih efektif. Dengan adanya audit pengelolaan sekolah, pengelolaan sekolah akan memenuhi kualitas dan standar yang sesuai dengan Standar Nasional Pendidikan. Hasil penelitian audit pengelolaan sekolah dengan metode process mining yang menggunakan empat algoritma diantaranya Algoritma Alpha miner, Algoritma Fuzzy miner, Algoritma Heuristic miner, dan Algoritma Process tree dinilai memiliki kesesuaian yang tepat terhadap data yang ada. Dari hasil penelitian audit pengelolaan sekolah ini dapat disimpulkan persentase yang didapatkan dari masing masing algoritma, yaitu pada algoritma Alpha miner hasil persentase fitness 0,95 (95%) dan precision 0,9 (90%), pada algoritma Heuristic miner hasil persentase fitness 0,972 (97,2%) dan precision 0,83 (83%), pada algoritma Process tree hasil persentase fitness 0,98 (98%) dan precision 1 (100%), pada algoritma Fuzzy miner hasil persentase fitness 0,99 (99%) dan precision 0,915 (91,5%).

Translating Workflow Nets to Process Trees: An Algorithmic Approach

Since their introduction, process trees have been frequently used as a process modeling formalism in many process mining algorithms. A process tree is a (mathematical) tree-based model of a process, in which internal vertices represent behavioral control-flow relations and leaves represent process activities. Translation of a process tree into a sound workflow net is trivial. However, the reverse is not the case. Simultaneously, an algorithm that translates a WF-net into a process tree is of great interest, e.g., the explicit knowledge of the control-flow hierarchy in a WF-net allows one to reason on its behavior more easily. Hence, in this paper, we present such an algorithm, i.e., it detects whether a WF-net corresponds to a process tree, and, if so, constructs it. We prove that, if the algorithm finds a process tree, the language of the process tree is equal to the language of the original WF-net. The experiments conducted show that the algorithm’s corresponding implementation has a quadratic time complexity in the size of the WF-net. Furthermore, the experiments show strong evidence of process tree rediscoverability.

Translating Workflow Nets to Process Trees: An Algorithmic Approach

Since their introduction, process trees have been frequently used as a process modeling formalism in many process mining algorithms. A process tree is a (mathematical) tree-based model of a process, in which internal vertices represent behavioral control-flow relations and leaves represent process activities. Translation of a process tree into a sound Workflow net is trivial; however, the reverse is not the case. Simultaneously, an algorithm that translates a WF-net into a process tree is of great interest, e.g., the explicit knowledge of the control-flow hierarchy in a WF-net allows one to reason on its behavior more easily. Hence, in this paper, we present such an algorithm, i.e., it detects whether a WF-net corresponds to a process tree, and, if so, constructs it. We prove that, when the algorithm finds a process tree, the language of the process tree is equal to the language of the original WF-net. The experiments conducted show that the algorithm’s corresponding implementation has a quadratic time complexity in the size of the WF-net. Furthermore, the experiments show strong evidence of process tree re-discoverability.

Verification Method for Accumulative Event Relation of Message Passing Behavior with Process Tree for IoT Systems

In this paper, we proposed a verification method for the message passing behavior of IoT systems by checking the accumulative event relation of process models. In an IoT system, it is hard to verify the behavior of message passing by only looking at the sequence of packet transmissions recorded in the system log. We proposed a method to extract event relations from the log and check for any minor deviations that exist in the system. Using process mining, we extracted the variation of a normal process model from the log. We checked for any deviation that is hard to be detected unless the model is accumulated and stacked over time. Message passing behavior can be verified by comparing the similarity of the process tree model, which represents the execution relation between each message passing event. As a result, we can detect minor deviations such as missing events and perturbed event order with occurrence probability as low as 3%.

Follow the Plants

Through poetic glimpses of an ongoing participatory art process, Tree Memory Gathering, this essay considers the special issue theme by questioning, “How might the concept of ‘social warming’ invite new possibilities for creative-relational inquiry?” Responses unfold through three variations of social warming inspired by socially engaged art and ecopoetry. These variations—gathering, participatory bookmaking, and perforating—unsettle residual boundaries between tree bodies and human bodies, generating ecological wisdom for living and inquiring differently in the world. Perforating is theorized as an alternative to research findings in post-qualitative approaches to inquiry.

Process tree-based analysis method of DECLARE relation constraints in acyclic bridge-less well-structured workflow nets

In this paper, we proposed a method to analyze workflows’ constraints whose templates are defined in a declarative language called DECLARE. Checking such constraints is important but known to be intractable in general. Our results show three things. First, utilizing a tree representation of workflow process called {\it process tree}, we provided necessary and sufficient conditions on the constraints. Second, those conditions enable us to not only check a given constraint in polynomial time but also find a clue for improving the net if it violates the constraint. Third, we revealed the relationship among the constraint templates.