Sciweavers

64 search results - page 6 / 13
» A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
Sort
View
JUCS
2007
95views more  JUCS 2007»
13 years 7 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
ENTCS
2002
103views more  ENTCS 2002»
13 years 7 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
Marc Boyer
APN
2009
Springer
14 years 2 months ago
Hasse Diagram Generators and Petri Nets
In [LJ06] Lorenz and Juh´as raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets...
Mateus de Oliveira Oliveira
APN
2005
Springer
14 years 1 months ago
Continuization of Timed Petri Nets: From Performance Evaluation to Observation and Control
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...
Manuel Silva, Laura Recalde
SCESM
2006
ACM
266views Algorithms» more  SCESM 2006»
14 years 1 months ago
A comparative survey of scenario-based to state-based model synthesis approaches
Model Driven Development and Use Case Driven Development methodologies have inspired the proposal of a variety of software engineering approaches that synthesize statebased models...
Hongzhi Liang, Jürgen Dingel, Zinovy Diskin