Sciweavers

297 search results - page 2 / 60
» An Algebra for Directed Bigraphs
Sort
View
ECEASST
2008
106views more  ECEASST 2008»
13 years 6 months ago
Controlling resource access in Directed Bigraphs
: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous vers...
Davide Grohmann, Marino Miculan
ECEASST
2010
13 years 3 months ago
Graph Algebras for Bigraphs
In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, ...
Davide Grohmann, Marino Miculan
COORDINATION
2006
Springer
13 years 10 months ago
Formalising Business Process Execution with Bigraphs and Reactive XML
Bigraphical Reactive Systems have been proposed as a meta model for global ubiquitous computing generalising process calculi for mobility such as the pi-calculus and the Mobile Amb...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen
CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 1 months ago
Finitely generated free Heyting algebras via Birkhoff duality and coalgebra
Algebras axiomatized entirely by rank 1 axioms are algebras for a functor and thus the free algebras can be obtained by a direct limit process. Dually, the final coalgebras can be...
Nick Bezhanishvili, Mai Gehrke
ISCAS
1999
IEEE
95views Hardware» more  ISCAS 1999»
13 years 10 months ago
Evaluating iterative improvement heuristics for bigraph crossing minimization
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
Matthias F. M. Stallmann, Franc Brglez, Debabrata ...