Sciweavers

136 search results - page 2 / 28
» Complexity Results for 1-safe Nets
Sort
View
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
13 years 10 months ago
Net Reductions for LTL Model-Checking
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
Javier Esparza, Claus Schröter
IJAR
2010
75views more  IJAR 2010»
13 years 4 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...
JCSS
2010
111views more  JCSS 2010»
13 years 4 months ago
Reduction rules for reset/inhibitor nets
Abstract. Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. A reset arc allows a transition to remove all tokens from a certain place when the transi...
H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van ...
TCS
2011
13 years 24 days ago
An algorithmic framework for network reconstruction
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the re...
Markus Durzinsky, Annegret Wagler, Robert Weismant...
DEDS
1998
152views more  DEDS 1998»
13 years 5 months ago
Timed Petri Nets in Hybrid Systems: Stability and Supervisory Control
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
Xenofon D. Koutsoukos, Kevin X. He, Michael D. Lem...