Sciweavers

99 search results - page 9 / 20
» Complete Process Semantics of Petri Nets
Sort
View
LREC
2008
132views Education» more  LREC 2008»
13 years 9 months ago
Complete and Consistent Annotation of WordNet using the Top Concept Ontology
This paper presents the complete and consistent ontological annotation of the nominal part of WordNet. The annotation has been carried out using the semantic features defined in t...
Javier Álvez, Jordi Atserias, Jordi Carrera...
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
13 years 12 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
CONCUR
2001
Springer
14 years 4 days ago
Bounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
Keijo Heljanko
ACSD
2001
IEEE
91views Hardware» more  ACSD 2001»
13 years 11 months ago
Synthesis of Net Systems with Inhibitor Arcs from Step Transition Systems
We here consider transition systems of Elementary Net Systems with Inhibitor Arcs. There are basically two di erent types of non-interleaving semantics of such Petri nets, the a-po...
Marta Pietkiewicz-Koutny
TSE
1998
115views more  TSE 1998»
13 years 7 months ago
Integration and Analysis of Use Cases Using Modular Petri Nets in Requirements Engineering
—It is well known that requirements engineering plays a critical role in software quality. The use case approach is a requirements elicitation technique commonly used in industri...
Woo Jin Lee, Sung Deok Cha, Yong Rae Kwon