2436 search results - page 129 / 488 » Comonadic Notions of Computation |
126
click to vote
RELMICS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implica...
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...
110
click to vote
CONEXT
2008
ACM
15 years 5 months ago
2008
ACM
Recursive temporal (RT) namespaces extend spatial namespaces such as IP with the notion of a nested time interval. RT namespace is an architectural approach to dealing with the un...
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...
162
click to vote
CLUSTER
2004
IEEE
15 years 3 months ago
2004
IEEE
Fault tolerance in parallel systems has traditionally been achieved through a combination of redundancy and checkpointing methods. This notion has also been extended to message-pas...