Sciweavers

220 search results - page 3 / 44
» On Nets, Algebras and Modularity
Sort
View
FUIN
2007
108views more  FUIN 2007»
13 years 5 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou
JCSC
1998
159views more  JCSC 1998»
13 years 5 months ago
An Approach to Object System Modeling by State-Based Object Petri Nets
For many years, Petri nets have been used for modeling the behavior of various types of concurrent systems. While these net models are especially well suited to capture the behavi...
A. Newman, Sol M. Shatz, X. Xie
EUROCAST
1997
Springer
85views Hardware» more  EUROCAST 1997»
13 years 9 months ago
Turing Universality of Neural Nets (Revisited)
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
João Pedro Guerreiro Neto, Hava T. Siegelma...
ENTCS
2010
84views more  ENTCS 2010»
13 years 3 months ago
Syntactic Language Extension via an Algebra of Languages and Transformations
We propose an algebra of languages and transformations as a means for extending s syntactically. The algebra provides a layer of high-level abstractions built on top of languages ...
Jacob Andersen, Claus Brabrand
APN
1992
Springer
13 years 9 months ago
Towards a Modular Analysis of Coloured Petri Nets
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...
Søren Christensen, Laure Petrucci