Filters








1,133 Hits in 4.2 sec

Towards an Efficient Algorithm for Unfolding Petri Nets [chapter]

Victor Khomenko, Maciej Koutny
2001 Lecture Notes in Computer Science  
In this paper, we propose several improvements to the existing algorithms for generating finite complete prefixes of net unfoldings.  ...  Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem.  ...  Heljanko, and the anonymous referees for helpful comments. The first author was supported by an ORS Awards Scheme grant ORS/C20/4 and by an EPSRC grant GR/M99293.  ... 
doi:10.1007/3-540-44685-0_25 fatcat:uwvsa6qwnzdqzahrj533mwzhhq

An Incremental and Backward-Conflict Guided Method for Unfolding Petri Nets

Dongming Xiang, Xiaoyan Tao, Yaping Liu
2021 Symmetry  
During the unfolding process of a Petri net, the calculations of configurations, cuts, and cut-off events are the key factors for the unfolding efficiency.  ...  The unfolding technique of Petri net can characterize the real concurrency and alleviate the state space explosion problem.  ...  improves the calculational efficiency of Petri net unfolding.  ... 
doi:10.3390/sym13030392 fatcat:zx755qcq4nechphomg6ygf5ftq

Computational Issues in Intelligent Control: Discrete-Event and Hybrid Systems [chapter]

XENOFON D. KOUTSOUKOS, PANOS J. ANTSAKLIS
2000 Soft Computing and Intelligent Systems  
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.  ...  algorithms and approaches.  ...  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

Characterization of Reachable Attractors Using Petri Net Unfoldings [chapter]

Thomas Chatain, Stefan Haar, Loïg Jezequel, Loïc Paulevé, Stefan Schwoon
2014 Lecture Notes in Computer Science  
The algorithm relies on Petri net unfoldings that can be used to compute a compact representation of the dynamics.  ...  We illustrate the applicability of the algorithm with Petri net models of cell signalling and regulation networks, Boolean and multi-valued.  ...  To our knowledge this is the first algorithm for computing all the reachable attractors which relies on unfolding structures. Our algorithm is applicable to any safe Petri net.  ... 
doi:10.1007/978-3-319-12982-2_10 fatcat:upv2veygs5eodfl43nwi4jgqai

Verification of Petri Nets with Read Arcs [chapter]

César Rodríguez, Stefan Schwoon
2012 Lecture Notes in Computer Science  
Recent work studied the unfolding construction for contextual nets, i.e. nets with read arcs. Such unfoldings are more concise and can usually be constructed more efficiently than for Petri nets.  ...  In contrast, every event in a Petri net unfolding has only one history. Some verification algorithms for Petri nets rely on this fact and do not easily adapt to c-nets.  ...  Acknowledgements: The authors would like to thank Keijo Heljanko, Victor Khomenko, Paolo Baldan, and the referees for helpful hints and discussions.  ... 
doi:10.1007/978-3-642-32940-1_33 fatcat:2ygcudxtorh7bj2eatqyavczqa

Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation Systems

Barbara König, Vitali Kozioura
2008 Electronical Notes in Theoretical Computer Science  
It is based on Augur 1, a tool which can analyze graph transformation systems by approximating them by Petri nets.  ...  The main reason for the new development was to create an open, flexible and extensible verification environment.  ...  The current layout of the tool also makes it easy to replace an old inefficient version of an algorithm by a more efficient one and to use different versions of an algorithm in different situations.  ... 
doi:10.1016/j.entcs.2008.04.042 fatcat:sqtqei53dzdtjmvzyzw5fboh5y

Computing the Reveals Relation in Occurrence Nets

Stefan Haar, Christian Kern, Stefan Schwoon
2011 Electronic Proceedings in Theoretical Computer Science  
We then show that there exists an efficient algorithm for computing the relation on a given prefix. We have implemented the algorithm and report on experiments.  ...  Petri net unfoldings are a useful tool to tackle state-space explosion in verification and related tasks.  ...  The authors would like to thank the reviewers for their careful work and suggestions. In particular, the idea for the proof of PSPACEhardness was suggested by one of the reviewers.  ... 
doi:10.4204/eptcs.54.3 fatcat:pwyqy5fnsnfdvd5lx66bwi34me

Computing the reveals relation in occurrence nets

Stefan Haar, Christian Kern, Stefan Schwoon
2013 Theoretical Computer Science  
We then show that there exists an efficient algorithm for computing the relation on a given prefix. We have implemented the algorithm and report on experiments.  ...  Petri net unfoldings are a useful tool to tackle state-space explosion in verification and related tasks.  ...  The authors would like to thank the reviewers for their careful work and suggestions. In particular, the idea for the proof of PSPACEhardness was suggested by one of the reviewers.  ... 
doi:10.1016/j.tcs.2013.04.028 fatcat:wgfdii7innhifnhh5s2otvin5e

Log-Based Simplification of Process Models [chapter]

Javier De San Pedro, Josep Carmona, Jordi Cortadella
2015 Lecture Notes in Computer Science  
The visualization of models is essential for user-friendly human-machine interactions during Process Mining.  ...  The algorithms, either cast as optimization problems or heuristically guided, find simplified versions of the initial process model, and can be applied in the final stage of the process mining life-cycle  ...  We would also like to thank to Seppe vanden Broucke, Jorge Munoz-Gama and Thomas Gschwind for their great help in the experiments.  ... 
doi:10.1007/978-3-319-23063-4_30 fatcat:q2x3m5qnije6fgmpetmnntcf5u

A Static Analysis Technique for Graph Transformation Systems [chapter]

Paolo Baldan, Andrea Corradini, Barbara König
2001 Lecture Notes in Computer Science  
We present an algorithm which, given a graph transformation system and a start graph, produces a finite structure consisting of a hypergraph decorated with transitions (Petri graph) which can be seen as  ...  an approximation of the Winskel style unfolding of the graph transformation system.  ...  We are also grateful to anonymous referees for their valuable comments.  ... 
doi:10.1007/3-540-44685-0_26 fatcat:hkyuabbhgfd4zj254sy32q6vei

Non-interference by Unfolding [chapter]

Paolo Baldan, Alberto Carraro
2014 Lecture Notes in Computer Science  
This leads to an algorithm for checking BNDC for safe Petri nets which relies on the construction of suitable complete prefixes of the unfolding. A prototype tool provides very promising results.  ...  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  ...  We are grateful to César Rodríguez for developing the tool CUNF and for his suggestions on its use for producing UBIC.  ... 
doi:10.1007/978-3-319-07734-5_11 fatcat:pxxh4wxdxfghjik32kumpgudku

Optimizing Verification of Structurally Evolving Algebraic Petri Nets [chapter]

Yasir Imtiaz Khan
2013 Lecture Notes in Computer Science  
In this work, we introduce an Algebraic Petri net slicing technique that optimizes the model checking of static or structurally evolving APN models.  ...  Among the existing development methodologies the iterative and incremental one has been proved to be efficient for system development but lacks of support for an adequate verification process.  ...  We can build a slice for an unfolded APN based on Q, using following algorithm: Algorithm 1: APN slicing algorithm for unfolded APN model APNSlicing( SP EC, P, T, F, asg, cond, λ, m 0 , Q){ T = {t ∈ T  ... 
doi:10.1007/978-3-642-40894-6_6 fatcat:hltw75pnorgixnsk3v2cneblcu

Construction and SAT-Based Verification of Contextual Unfoldings [chapter]

Stefan Schwoon, César Rodríguez
2011 Lecture Notes in Computer Science  
We discuss the problem of (efficiently) constructing unfoldings of such nets.  ...  Unfoldings succinctly represent the set of reachable markings of a Petri net.  ...  Constructing Contextual Unfoldings We sketch the main ideas for the algorithms behind efficiently constructing complete finite unfolding prefixes.  ... 
doi:10.1007/978-3-642-22600-7_3 fatcat:47fyfowkpnflbbss2ir3nj5zou

Enforcing transition deadlines in time Petri nets

Haisheng Wang, Liviu Grigore, Ugo Buy, Houshang Darabi
2007 2007 IEEE Conference on Emerging Technologies & Factory Automation (EFTA 2007)  
We model both the controlled system and our control supervisors as time Petri nets.  ...  Our method is subject to a merge exclusion assumption on the structure of paths contained in a so-called net unfolding.  ...  Thus, the clock and supervisor subnets for the net shown in Figure Net unfolding The unfolding of an ordinary Petri net N is an unmarked Petri net U whose places and transitions are mapped to N '  ... 
doi:10.1109/efta.2007.4416824 dblp:conf/etfa/WangGBD07 fatcat:b5v4fdmacrag7khtjcbebz3b7q

Efficient unfolding of contextual Petri nets

Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, César Rodríguez, Stefan Schwoon
2012 Theoretical Computer Science  
Contextual nets allow for better modelling of concurrent read access than Petri nets, and their unfoldings can be exponentially more compact than those of a corresponding Petri net.  ...  These show that not only are contextual unfoldings more compact than Petri net unfoldings, but they can be computed with the same or better efficiency, in particular with respect to alternative approaches  ...  Notice that there exist efficient tools for the unfolding of Petri nets, such as Mole [12] or Punf [19] .  ... 
doi:10.1016/j.tcs.2012.04.046 fatcat:wubz3yx4evbuhanz575fxkepji
« Previous Showing results 1 — 15 out of 1,133 results