Sciweavers

191 search results - page 10 / 39
» Transition systems, link graphs and Petri nets
Sort
View
APN
2010
Springer
14 years 23 days ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
LATA
2010
Springer
13 years 6 months ago
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
Fernando Rosa Velardo, Giorgio Delzanno
DSS
2006
108views more  DSS 2006»
13 years 8 months ago
Matching observed behavior and modeled behavior: An approach based on Petri nets and integer programming
Inspired by the way SAP R/3 and other transactional information systems log events, we focus on the problem to decide whether a process model and a frequency profile "fit"...
Wil M. P. van der Aalst
TACAS
2009
Springer
167views Algorithms» more  TACAS 2009»
14 years 2 months ago
ITPN-PerfBound: A Performance Bound Tool for Interval Time Petri Nets
The ITPN-PerfBound is a tool for the modeling and analysis of Interval Time Petri Nets (ITPN), that is Petri Nets in which firing time intervals, and possibly firing frequency in...
Elina Pacini Naumovich, Simona Bernardi, Marco Gri...
FUIN
2007
123views more  FUIN 2007»
13 years 8 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc