Sciweavers

941 search results - page 125 / 189
» Petri Nets Are Dioids
Sort
View
CIBCB
2007
IEEE
15 years 6 months ago
Spectral Decomposition of Signaling Networks
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
Bahram Parvin, Nirmalya Ghosh, Laura Heiser, Merri...
APN
2007
Springer
15 years 6 months ago
Improving Static Variable Orders Via Invariants
Abstract. Choosing a good variable order is crucial for making symbolic state-space generation algorithms truly efficient. One such algorithm is the MDD-based Saturation algorithm ...
Gianfranco Ciardo, Gerald Lüttgen, Andy Jinqi...
SCESM
2006
ACM
266views Algorithms» more  SCESM 2006»
15 years 5 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
APN
2005
Springer
15 years 5 months ago
Determinate STG Decomposition of Marked Graphs
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
Mark Schäfer, Walter Vogler, Petr Jancar
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 5 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre