Sciweavers

957 search results - page 122 / 192
» Negotiations and Petri Nets
Sort
View
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
CONCUR
2004
Springer
15 years 5 months ago
The Pros and Cons of Netcharts
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 ...
Nicolas Baudru, Rémi Morin
ACSD
2003
IEEE
125views Hardware» more  ACSD 2003»
15 years 5 months ago
Modelling a Secure, Mobile, and Transactional System with CO-OPN
Modelling complex concurrent systems is often difficult and error-prone, in particular when new concepts coming from advanced practical applications are considered. These new appl...
Didier Buchs, Stanislav Chachkov, David Hurzeler