Sciweavers

148 search results - page 6 / 30
» An Algebraic Theory of Graph Reduction
Sort
View
BIRTHDAY
2000
Springer
14 years 23 days ago
Discrete time process algebra with silent step
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Renie...
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 5 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer
ICALP
2003
Springer
14 years 1 months ago
Bisimulation Proof Methods for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
Massimo Merro, Francesco Zappa Nardelli
GC
2010
Springer
13 years 7 months ago
Intriguing Sets of Vertices of Regular Graphs
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
Bart De Bruyn, Hiroshi Suzuki
ENTCS
2002
108views more  ENTCS 2002»
13 years 8 months ago
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
Thomas Colcombet