A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Decomposed Process Mining: The ILP Case
[chapter]
2015
Lecture Notes in Business Information Processing
Preserved Fulltext
A small case study shows that we can gain orders of magnitude in run-time. However, in some cases there is tradeoff between run-time and quality. ...
ILP-based process mining techniques provide precise results and formal guarantees (e.g., perfect fitness), but are known to scale badly in the number of activities. ...
Petri Net
Causal Activity Matrix
Causal Activity Graph
Activity Clusters Array
Event Logs Array
Accepting Petri Net Array
Log Alignment Array
Accepting Petri Net
Log Alignment
Divide Conquer ...
doi:10.1007/978-3-319-15895-2_23
fatcat:faidpgvvinejvjs2vigzyqckte
An Experimental Evaluation of Passage-Based Process Discovery
[chapter]
2013
Lecture Notes in Business Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the area of process mining, the ILP Miner is known for the fact that it always returns a Petri net that perfectly fits a given event log. ...
Like for most process discovery algorithms, its complexity is linear in the size of the event log and exponential in the number of event classes (i.e., distinct activities). ...
A contains test events for the deployment of high-tech equipment, which contains both in-factory tests and on-site test events. B is the BPI Challenge 2012 event log [6] . ...
doi:10.1007/978-3-642-36285-9_21
fatcat:tcaif7airvaxng5jwhzkoxqhtm
Modeling Causal Consistency in a Distributed Shared Memory using Hierarchical Colored Petri Net
2015
Indian Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, a new modeling of the causal consistency checking in a distributed shared memory is presented using the hierarchical colored Petri net, and its rules and properties are modeled with all ...
In fact, pre-production modeling and simulation of the industrial systems using the hierarchical colored Petri net will be economically and very affordable. ...
These implementations are based on Full-Track, Opt-Track and Opt-Track-CRP algorithms. Colored Petri net is a top-level Petri net which uses ML language 16 . ...
doi:10.17485/ijst/2015/v8i33/75502
fatcat:lhlu2hbzhbbl3iocoe46tmg2zq
Causal Atomicity
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The causality between events in the partially ordered executions of the Petri net is used to define the notion of causal atomicity. ...
We show that causal atomicity is a robust notion that many correct programs adopt, and show how we can effectively check causal atomicity using Petri net tools based on unfoldings, which exploit the concurrency ...
Section 3 defines the modeling of a program as a Petri net and defines causal atomicity based on the traces generated by this net. ...
doi:10.1007/11817963_30
fatcat:xxady6si3zdmfblqv7tpmejfoa
An exploratory study of program metrics as predictors of reachability analysis performance
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and deadlock check times for ...
In general, reachability analysis is intractable, so it is important to be able to predict whether or not this analysis technique is feasible given a specific program to be analyzed. ...
Acknowledgements Many thanks are due to Lori Clarke, whose diligent reviews led to significant improvements in this paper. ...
doi:10.1007/3-540-60406-5_24
fatcat:rzkrc2lwpnatpen7ivucbyptsy
Automatic Information Flow Analysis of Business Process Models
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Building on the concept of Place-based Non-Interference, the novelty is that Petri net reachability is employed to detect places in which information leaks occur. ...
Anica employs state of the art modelchecking algorithms to test reachability. ...
The work is partially funded by the German Research Foundation in the project WS4Dsec of the priority program Reliably Secure Software Systems (SPP 1496). ...
doi:10.1007/978-3-642-32885-5_13
fatcat:hs3le67s2vg3rkpwnxf5bdhb7y
Conformance of Distributed Systems
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This equivalence depends on the structural properties of the Petri net and is independent of any specific initial marking. ...
The conformance relation is defined via Petri nets and shows not only equivalence between transitions but also equivalence between local states. ...
For extended Petri nets, we model executions by causal nets; thus, conformance will be based on a relation between causal nets. In the following Definition 9, we propose two different alternatives. ...
doi:10.1007/3-540-44830-6_13
fatcat:ncyrke2rsbf2tdkngq2426az2m
Non-interference by Unfolding
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that BNDC admits natural characterisations based on the unfolding semantics -a classical true concurrent semantics for Petri nets -in terms of causalities and conflicts between high and low level ...
Here we focus on Petri nets and on the BNDC property (Bisimilarity-based Non-Deducibility on Composition), a formalisation of non-interference widely studied in the literature. ...
In §2 we define Petri nets and BNDC, the non-interference notion we will work with. In §3 we give a characterisation of BNDC based on causal and conflict places. ...
doi:10.1007/978-3-319-07734-5_11
fatcat:pxxh4wxdxfghjik32kumpgudku
Exploiting mobile contexts for Petri-net to generate a story in cartoons
2009
Applied intelligence (Boston)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Petri-net based storytelling approach reduces the uncertainty in mobile environment and increases the diversity and causality of a story. ...
This paper proposes a Petri-net based method that organizes mobile contexts to an understandable and interesting story in cartoons. ...
Petri-net based script for an episode In this paper, Petri-net is used for representing relationship between events. ...
doi:10.1007/s10489-009-0175-x
fatcat:c6roe5mwfbhwhpiaxz2dwa5jre
A Rule-Based Approach for Process Discovery: Dealing with Noise and Imbalance in Process Logs
2006
Data mining and knowledge discovery
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Knowing the causal, exclusive, and parallel relations, a process model expressed in the Petri net formalism can be built. We illustrate our approach with real world data in a case study. ...
A completely specified process design needs to be developed in order to enact a given business process. This development is time consuming and often subjective and incomplete. ...
., the number of times an element of T * appears in the process log). 3. We use a capital letter and || when referring to the number of occurrences of some task. 4. ...
doi:10.1007/s10618-005-0029-z
fatcat:ffxcuu2yxvespmqwx7qyqyeaue
Petri Games: Synthesis of Distributed Systems with Causal Memory
2014
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present a new multiplayer game model for the interaction and the flow of information in a distributed system. The players are tokens on a Petri net. ...
As long as the players move in independent parts of the net, they do not know of each other; when they synchronize at a joint transition, each player gets informed of the causal history of the other player ...
In Section 3 we introduce the notion of Petri games and define strategies based on net unfoldings. ...
doi:10.4204/eptcs.161.19
fatcat:ljq6a5frije47lnplu22afwrfi
Petri games: Synthesis of distributed systems with causal memory
2017
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a new multiplayer game model for the interaction and the flow of information in a distributed system. The players are tokens on a Petri net. ...
As long as the players move in independent parts of the net, they do not know of each other; when they synchronize at a joint transition, each player gets informed of the causal history of the other player ...
In Section 3 we introduce the notion of Petri games and define strategies based on net unfoldings. ...
doi:10.1016/j.ic.2016.07.006
fatcat:6il4eeyuw5d6po45khh7jt73rq
Process Discovery Using Integer Linear Programming
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a process discovery algorithm where we use concepts taken from the language-based theory of regions, a wellknown Petri net research area. ...
Such a Petri net should (1) be able to reproduce the log under consideration and (2) be independent of the number of cases in the log. ...
This theory focusses on the synthesis of Petri nets from state-based models, where the statespace of the Petri net is branching bisimilar to the given state-based model. ...
doi:10.1007/978-3-540-68746-7_24
fatcat:j74f5gsr7redxhp4x4dgvk433a
Can I Execute My Scenario in Your Net? VipTool Tells You!
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Further, the VipVerify Module allows to test in polynomial time whether a scenario equals an execution with minimal causality. ...
A specified LPO is an execution of a Petri net if it is a (partial) sequentialization of an LPO generated by a process of the net. ...
In such cases it is helpful to have the possibility not to check on all the processes by unfolding the Petri net, but to directly test a particular scenario to be a possible execution of the Petri net ...
doi:10.1007/11767589_21
fatcat:fhr5otqsyjcq3ap33xj5zqlmom
Information leak detection in business process models: Theory, application, and tool support
2015
Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Building on the concept of placebased non-interference and declassification, the core contribution of this paper is the application of Petri net reachability to detect places in which information leaks ...
An extensive evaluation comprising over 550 industrial process models is carried out and shows that information flow analysis of process models can be done in milliseconds. ...
The work is partially funded by the German Research Foundation in the project WS4Dsec of the priority program Reliably Secure Software Systems (SPP 1496). ...
doi:10.1016/j.is.2013.12.006
fatcat:ev25aru23zeltpr6gb52pkq63i
« Previous
Showing results 1 — 15 out of 6,322 results