Sciweavers

1019 search results - page 65 / 204
» Petri Net Transformations in the
Sort
View
JCSS
2010
68views more  JCSS 2010»
13 years 6 months ago
Simplified proof of the blocking theorem for free-choice Petri nets
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
Joachim Wehler
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
RECOMB
2005
Springer
14 years 8 months ago
The Pathalyzer: A Tool for Analysis of Signal Transduction Pathways
Abstract. The Pathalyzer is a program for analyzing large-scale signal transduction networks. Reactions and their substrates and products are represented as transitions and places ...
David L. Dill, Merrill Knapp, Pamela Gage, Carolyn...
CALCO
2009
Springer
141views Mathematics» more  CALCO 2009»
14 years 2 months ago
Unfolding Grammars in Adhesive Categories
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
IFM
2009
Springer
119views Formal Methods» more  IFM 2009»
14 years 2 months ago
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
Abstract. To model real-life critical systems, one needs“high-level”languages to express three important concepts: complex data structures, concurrency, and real-time. So far, ...
Jan Stöcker, Frédéric Lang, Hub...