Sciweavers

201 search results - page 16 / 41
» Petri nets with causal time for system verification
Sort
View
TOPNOC
2008
13 years 8 months ago
Time Recursive Petri Nets
Recursive Petri Nets (RPNs) allow to design and analyze complex discrete event systems. Indeed, RPNs enable to model patterns of discrete event systems related to the dynamic struc...
Djaouida Dahmani, Jean-Michel Ilié, Malika ...
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
14 years 1 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
AIME
2009
Springer
14 years 27 days ago
Modeling Clinical Guidelines through Petri Nets
Abstract. Clinical guidelines (GLs) play an important role to standardize and organize clinical processes according to evidence-based medicine. Several computer-based GL representa...
Marco Beccuti, Alessio Bottrighi, Giuliana Frances...
SIMPRA
2008
137views more  SIMPRA 2008»
13 years 8 months ago
An admissible-behaviour-based analysis of the deadlock in Petri-net controllers
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
G. Music, Drago Matko
TOPNOC
2008
13 years 8 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...