Sciweavers

328 search results - page 20 / 66
» Graph Algebras for Bigraphs
Sort
View
ACSD
2008
IEEE
107views Hardware» more  ACSD 2008»
13 years 9 months ago
Discrete real-time and stochastic-time process algebra for performance analysis of distributed systems
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...
Jasen Markovski, Erik P. de Vink
ICALP
2010
Springer
14 years 13 days ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
ECEASST
2006
123views more  ECEASST 2006»
13 years 7 months ago
Algebraic High-Level Nets as Weak Adhesive HLR Categories
Abstract. Adhesive high-level replacement (HLR) system have been recently introduced as a new categorical framework for graph transformation in the double pushout approach [1, 2]. ...
Ulrike Prange
WEBDB
2004
Springer
191views Database» more  WEBDB 2004»
14 years 1 months ago
Visualizing and Discovering Web Navigational Patterns
Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analys...
Jiyang Chen, Lisheng Sun, Osmar R. Zaïane, Ra...
DM
2008
79views more  DM 2008»
13 years 7 months ago
The reconstruction conjecture and edge ideals
Given a simple graph G on n vertices, we prove that it is possible to reconstruct several algebraic properties of the edge ideal from the deck of G, that is, from the collection o...
Kia Dalili, Sara Faridi, Will Traves