Sciweavers

1788 search results - page 55 / 358
» Model Theory for Process Algebra
Sort
View
JLP
2007
89views more  JLP 2007»
15 years 15 days ago
Preferential choice and coordination conditions
We present a process algebra with conditional expressions of which the conditions concern the enabledness of actions in the context in which a process is placed. With those conditi...
Jan A. Bergstra, C. A. Middelburg
95
Voted
GG
2004
Springer
15 years 6 months ago
Fundamental Theory for Typed Attributed Graph Transformation
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer
EMSOFT
2007
Springer
15 years 6 months ago
The algebra of connectors: structuring interaction in BIP
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types a...
Simon Bliudze, Joseph Sifakis
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 23 days ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
92
Voted
CONCUR
2009
Springer
15 years 7 months ago
Weighted Bisimulation in Linear Algebraic Form
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
Michele Boreale