Sciweavers

220 search results - page 9 / 44
» On Nets, Algebras and Modularity
Sort
View
TCS
2008
13 years 7 months ago
Petri nets are less expressive than state-extended PA
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...
Mojmír Kretínský, Vojtech Reh...
APN
2001
Springer
14 years 6 days ago
Optimising Enabling Tests and Unfoldings of Algebraic System Nets
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
Marko Mäkelä
ISSAC
2004
Springer
94views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Algorithms for polynomial GCD computation over algebraic function fields
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
Mark van Hoeij, Michael B. Monagan
GPCE
2007
Springer
14 years 1 months ago
Constructing language processors with algebra combinators
Modular Monadic Semantics (MMS) is a well-known mechanism for structuring modular denotational semantic definitions for programming languages. The principal attraction of MMS is ...
Philip Weaver, Garrin Kimmell, Nicolas Frisby, Per...
ICCSA
2005
Springer
14 years 1 months ago
Modelling of Process of Electronic Signature with Petri Nets and (Max, Plus) Algebra
This article discusses the modelling and the evaluation of process of electronic signature (ES). According to a certain point of view, this process can be shown as a class of Dynam...
Ahmed Nait-Sidi-Moh, Maxime Wack