941 search results - page 125 / 189 » History-Dependent Petri Nets |
145
click to vote
APN
2007
Springer
16 years 11 days ago
2007
Springer
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 ...
192
click to vote
SCESM
2006
ACM
16 years 4 days ago
2006
ACM
Model Driven Development and Use Case Driven Development methodologies have inspired the proposal of a variety of software engineering approaches that synthesize statebased models...
145
click to vote
APN
2005
Springer
15 years 11 months ago
2005
Springer
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...
154
click to vote
ATVA
2005
Springer
15 years 11 months ago
2005
Springer
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 ...
155
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...