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
Unfolding-Based Process Discovery
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
After deriving an intermediate net unfolding from them, we perform a controlled folding giving rise to a Petri net which contains both the input log and all independence-equivalent traces arising from ...
Remarkably, the derived Petri net cannot execute any trace from the negative collection. The entire chain of transformations is fully automated. ...
Occurrence nets are the mathematical form of the partial order unfolding semantics of a Petri net [9] ; we use indifferently the terms occurrence net and unfolding. ...
doi:10.1007/978-3-319-24953-7_4
fatcat:yvoscarhvbgg3ndpvckesa67rq
Unfolding-Based Process Discovery
[article]
2015
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
After deriving an intermediate net unfolding from them, we perform a controlled folding giving rise to a Petri net which contains both the input log and all independence-equivalent traces arising from ...
Remarkably, the derived Petri net cannot execute any trace from the negative collection. The entire chain of transformations is fully automated. ...
Occurrence nets are the mathematical form of the partial order unfolding semantics of a Petri net [7] ; we use indifferently the terms occurrence net and unfolding. Lemma 1. ...
arXiv:1507.02744v1
fatcat:yw6bk6vmhrfxtkl62y2vuv4ia4
Automated Assistance for Search-Based Refactoring Using Unfolding of Graph Transformation Systems
[chapter]
2010
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.
In addition, I would like to thank many other members of the Department i of Computer Science at the University of Leicester for their help, and for creating a friendly and welcoming environment for work ...
Adbdul Qayum Khan (Late) who taught me that the best kind of knowledge to have is that which is learned for its own sake. God rest his soul in peace. Ameen! ...
One simply could not wish for a better or friendlier supervisor. I would also like to thank my examiners, Professor Dirk Yassens, and Dr. ...
doi:10.1007/978-3-642-15928-2_34
fatcat:dkwpg3ylnbdwtadpklbvrfogum
Abstract Interpretation with Unfoldings
[chapter]
2017
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.
Our main contribution is an unfolding algorithm that uses a new notion of independence to avoid redundant transformer application, thread-local fixed points to reduce the size of the unfolding, and a novel ...
cutoff criterion based on subsumption to guarantee termination of the analysis. ...
Abstract Interpretation with Unfoldings ...
doi:10.1007/978-3-319-63390-9_11
fatcat:n57filwwlfgilprwfeku75v2mm
Abstract Interpretation with Unfoldings
[article]
2017
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
Our main contribution is an unfolding algorithm that uses a new notion of independence to avoid redundant transformer application, thread-local fixed points to reduce the size of the unfolding, and a novel ...
cutoff criterion based on subsumption to guarantee termination of the analysis. ...
We design and implement an abstract unfoldings data structure and analysis that combines an abstract domain with the type of unfolding algorithm used to analyze Petri nets. ...
arXiv:1705.00595v1
fatcat:lqp4y6e6rvc2recrvrifapichq
A Formal Approach to the Integration of Performance Aspects in the Modeling and Analysis of Concurrent Systems
1998
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.
A formal approach for modeling and analyzing concurrent systems is proposed which integrates performance characteristics in the early stages of the design process. ...
The approach relies on both stochastically timed process algebras and stochastically timed Petri nets in order to exploit their complementary advantages. ...
the integrated net semantics. ...
doi:10.1006/inco.1998.2706
fatcat:ywrlpod2k5di3if472ajohxivq
Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation Systems
2008
Electronical Notes 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.
It is based on Augur 1, a tool which can analyze graph transformation systems by approximating them by Petri nets. ...
We describe the design and the present state of the verification tool Augur 2 which is currently being developed. ...
These specification languages have to be translated into properties on Petri net markings, since the analysis has to be done directly on the Petri net structure underlying the Petri graph. ...
doi:10.1016/j.entcs.2008.04.042
fatcat:sqtqei53dzdtjmvzyzw5fboh5y
Computational Issues in Intelligent Control: Discrete-Event and Hybrid Systems
[chapter]
2000
Soft Computing and Intelligent 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 2017; you can also visit the original URL.
The file type is application/pdf.
Petri net models are used to describe discrete event and hybrid systems. Computational issues of various problems and algorithms concerning the analysis and synthesis of such systems are discussed. ...
Finally, we present a parallel computing architecture for intelligent control systems and we illustrate its advantages by considering parallel discrete event simulations. ...
Nikos Chrisochoides of the Computer Science and Engineering Department at the University of Notre Dame for his valuable assistance concerning the parallel computing architecture. ...
doi:10.1016/b978-012646490-0/50006-8
fatcat:tpqu57oywrhwtfcrvohzhr3trq
Action Planning for Directed Model Checking of Petri Nets
2006
Electronical Notes 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 2019; you can also visit the original URL.
The file type is application/pdf.
Treating the firing of a transition as an action applied to a set of predicates induced by the Petri net structure and markings, the reachability analysis can be reduced to finding a plan to an AI planning ...
Finding a particular marking corresponding to a property violation in Petri nets can be reduced to exploring a state space induced by the set of reachable markings. ...
Numerical planning operator of a Petri net transition. which is then simplified to be compatible to a propositional planning formalism [22] . ...
doi:10.1016/j.entcs.2005.07.023
fatcat:d4n3b6iw5feqrmrimfei77a2pm
A Discretization Method from Coloured to Symmetric Nets: Application to an Industrial Example
[chapter]
2009
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 2020; you can also visit the original URL.
The file type is application/pdf.
Our methodology is based on transformations from Coloured Petri Nets (CPN) for their expressiveness to Symmetric Petri Nets (SN) to take advantage of their efficient verification techniques. ...
In this paper, we propose a methodological way to handle such hybrid systems with model checking on Petri Nets and algebraic methods. ...
Formal analysis of the system is performed at the Formal Verification step. Let us note that a similar transformation is achieved in [3] instead from coloured Petri nets to counter systems. ...
doi:10.1007/978-3-642-04856-2_7
fatcat:zpczxzi6nnf4rmym2aghlzahxm
30 Years of GreatSPN
[chapter]
2016
Springer Series in Reliability Engineering
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.
GreatSPN is a tool for the stochastic analysis of systems modelled as (stochastic) Petri nets. ...
This chapter reviews, with the help of a manufacturing system example, how GreatSPN is currently used for an integrated qualitative and quantitative analysis of Petri net systems, ranging from symbolic ...
The first point of the analysis is to check standard Petri net properties, like absence of deadlocks and liveness of transitions. ...
doi:10.1007/978-3-319-30599-8_9
fatcat:26gpbm3aa5eiblnhvqxipcjpjy
Synthesis of Petri Nets from Scenarios with VipTool
[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 2017; you can also visit the original URL.
The file type is application/pdf.
Second we explain how VipTool including the synthesis feature can be used for a stepwise and iterative formalization and validation procedure for business process Petri net models. ...
The aim of this tool paper is twofold: First we show that VipTool [9, 2] can now synthesize Petri nets from partially ordered runs. ...
ValidationOfOccNets: Allows to specify graphically certain properties of a Petri net, like specific forms of forbidden and desired behaviour. ...
doi:10.1007/978-3-540-68746-7_25
fatcat:pewr3lgdwjdzbknadthouovsay
Report on the Model Checking Contest at Petri Nets 2011
[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 2017; you can also visit the original URL.
The file type is application/pdf.
This article presents the results of the Model Checking Contest held within the SUMo 2011 workshop, a satellite event of Petri Nets 2011. ...
This contest aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets. ...
Gibelin (infrastructure and cluster management), Lom Hillah (production of PNML files), Emmanuel Paviot-Adet and Alexis Marechal (description of selected models), and Steve Hostettler (definition of properties ...
doi:10.1007/978-3-642-35179-2_8
fatcat:joniyupqprglhotup2mloxyv24
An Optimality Principle for Concurrent Systems
[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 2011; you can also visit the original URL.
The file type is application/pdf.
The formulation is significant because it provides a basis for the development of optimisation algorithms for decentralised decision systems including a recently proposed method based on Petri Net unfoldings ...
This paper presents a formulation of an optimality principle for a new class of concurrent decision systems formed by products of deterministic Markov decision processes (MDPs). ...
Acknowledgements The authors acknowledge the support of National ICT Australia and the Defence Science and Technology Organisation Australia through the Dynamic Planning, Optimisation and Learning Project ...
doi:10.1007/978-3-540-89378-3_13
fatcat:bpighm3qcfavrb646dyxcgx5oa
Untanglings: a novel approach to analyzing concurrent systems
2015
Formal Aspects of Computing
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.
A comparison with unfoldings demonstrates the practical advantages of untanglings. ...
of various behavioral properties of process models. ...
Petri Nets Petri nets are a well-known formalism for modeling concurrent systems. This section introduces the basic Petri net terminology and notations. ...
doi:10.1007/s00165-014-0329-4
fatcat:xcghcsnnmfccdpbeh35swqxqaq
« Previous
Showing results 1 — 15 out of 670 results