Sciweavers

210 search results - page 6 / 42
» Presenting Functors by Operations and Equations
Sort
View
DLT
1993
15 years 29 days ago
Rewriting Extended Regular Expressions
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
Valentin M. Antimirov, Peter D. Mosses
IJON
2006
82views more  IJON 2006»
14 years 11 months ago
Modeling single neuron behavior using stochastic differential equations
We model the intrinsic dynamic behavior of a neuron using stochastic differential equations and Brownian motion. Basis of our work is the deterministic one-compartmental multi-con...
Antti Saarinen, Marja-Leena Linne, Olli Yli-Harja
FOSSACS
2010
Springer
15 years 6 months ago
CIA Structures and the Semantics of Recursion
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
Stefan Milius, Lawrence S. Moss, Daniel Schwencke
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
15 years 5 months ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...
ICFP
2006
ACM
15 years 11 months ago
Recursive modules for programming
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
Keiko Nakata, Jacques Garrigue