Sciweavers

44 search results - page 4 / 9
» Separability in Persistent Petri Nets
Sort
View
APN
1993
Springer
13 years 11 months ago
Transient Analysis of Deterministic and Stochastic Petri Nets
This paper introduces an efficient numerical algorithm for transient analysis of deterministic and stochastic Petri nets (DSPNs) and other discrete-event stochastic systems with ...
Hoon Choi, Vidyadhar G. Kulkarni, Kishor S. Trived...
WSC
1998
13 years 8 months ago
Timed Petri Nets as a Verification Tool
This paper presents Timed Petri Nets (TPN) as an analytical approach for verification of computerized queueing network simulation models at steady state. It introduces a generic a...
Miryam Barad
ENTCS
2006
112views more  ENTCS 2006»
13 years 7 months ago
A Petri-Net Based Reflective Framework for the Evolution of Dynamic Systems
Nowadays, software evolution is a very hot topic. Many applications need to be updated or extended with new characteristics during their lifecycle. Software evolution is character...
Lorenzo Capra, Walter Cazzola
CN
2007
91views more  CN 2007»
13 years 7 months ago
Improving the quality of alerts and predicting intruder's next goal with Hidden Colored Petri-Net
Intrusion detection systems (IDS) often provide poor quality alerts, which are insufficient to support rapid identification of ongoing attacks or predict an intruder’s next lik...
Dong Yu, Deborah A. Frincke
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 26 days ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre