3454 search results - page 267 / 691 » Modern computer algebra |
191
click to vote
BIRTHDAY
2008
Springer
15 years 8 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...
173
click to vote
CADE
2008
Springer
15 years 8 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
146
click to vote
CIE
2006
Springer
15 years 8 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...
164
click to vote
CMSB
2008
Springer
15 years 8 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...
173
click to vote
CSR
2008
Springer
15 years 8 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...