Sciweavers

1369 search results - page 50 / 274
» On the Semantics of Petri Nets
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
13 years 9 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya
DSS
2006
108views more  DSS 2006»
13 years 9 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
AUTOMATICA
2004
109views more  AUTOMATICA 2004»
13 years 8 months ago
Optimal stationary behavior for a class of timed continuous Petri nets
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
Bruno Gaujal, Alessandro Giua
APN
2007
Springer
14 years 3 months ago
Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...
Marco Beccuti, Giuliana Franceschinis, Serge Hadda...
ICCAD
2003
IEEE
129views Hardware» more  ICCAD 2003»
14 years 5 months ago
ILP Models for the Synthesis of Asynchronous Control Circuits
A new technique for the logic synthesis of asynchronous circuits is presented. It is based on the structural theory of Petri nets and integer linear programming. The technique is ...
Josep Carmona, Jordi Cortadella