Sciweavers

101 search results - page 12 / 21
» On Reachability in Autonomous Continuous Petri Net Systems
Sort
View
SDL
2003
158views Hardware» more  SDL 2003»
15 years 17 days ago
Automatic Formal Model Generation and Analysis of SDL
A tool for verification of distributed systems defined using standard SDL-96 is described. The SDL description is automatically translated into a high-level Petri net model which...
Annikka Aalto, Nisse Husberg, Kimmo Varpaaniemi
FUIN
2007
116views more  FUIN 2007»
14 years 11 months ago
Decidability Problems of a Basic Class of Object Nets
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
Roxana Dietze, Manfred Kudlek, Olaf Kummer
CMSB
2007
Springer
15 years 5 months ago
A Unifying Framework for Modelling and Analysing Biochemical Pathways Using Petri Nets
We give a description of a Petri net-based framework for modelling and analysing biochemical pathways, which unifies the qualitative, stochastic and continuous paradigms. Each per...
David Gilbert, Monika Heiner, Sebastian Lehrack
DEDS
2008
87views more  DEDS 2008»
14 years 11 months ago
On-Line Monitoring of Large Petri Net Models Under Partial Observation
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
George Jiroveanu, René K. Boel, Behzad Bord...
ATVA
2006
Springer
100views Hardware» more  ATVA 2006»
15 years 3 months ago
A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
Ming-Ying Chung, Gianfranco Ciardo, Andy Jinqing Y...