Sciweavers

328 search results - page 26 / 66
» Graph Algebras for Bigraphs
Sort
View
FSTTCS
2008
Springer
13 years 8 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
ICFCA
2004
Springer
14 years 1 months ago
Background Knowledge in Concept Graphs
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
Frithjof Dau
ECEASST
2008
95views more  ECEASST 2008»
13 years 7 months ago
Graph Transformations for the Resource Description Framework
: The Resource Description Framework (RDF) is a standard developed by the World Wide Web Consortium (W3C) to facilitate the representation and exchange of structured (meta-)data in...
Benjamin Braatz, Christoph Brandt
BIRTHDAY
2000
Springer
14 years 23 hour 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...
RELMICS
1997
Springer
13 years 11 months ago
Relational Matching for Graphical Calculi of Relations
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
Wolfram Kahl