Sciweavers

80 search results - page 5 / 16
» Defining and specifying graphs using formal model-based tech...
Sort
View
APN
2007
Springer
15 years 3 months ago
Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...
Marco Beccuti, Giuliana Franceschinis, Serge Hadda...
89
Voted
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
15 years 10 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
ENTCS
2006
168views more  ENTCS 2006»
14 years 9 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
AGTIVE
2003
Springer
15 years 2 months ago
Local Specification of Surface Subdivision Algorithms
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
Colin Smith, Przemyslaw Prusinkiewicz, Faramarz F....
FM
2009
Springer
134views Formal Methods» more  FM 2009»
14 years 7 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu