1730 search results - page 193 / 346 » Algebra and Computation |
131
click to vote
AMAST
2008
Springer
15 years 6 months ago
2008
Springer
In a seminal paper Montanari and Meseguer showed that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation o...
144
click to vote
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented i...
119
click to vote
CIE
2006
Springer
15 years 6 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
118
click to vote
CMSB
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. This paper gives algebraic definitions for obtaining the minimal transition and place flows of a modular Petri net from the minimal transition and place flows of its comp...
132
click to vote
CSR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...