Sciweavers

217 search results - page 6 / 44
» Abstract Processes of Place Transition Systems
Sort
View
CALCO
2009
Springer
115views Mathematics» more  CALCO 2009»
14 years 2 months ago
Relating Coalgebraic Notions of Bisimulation
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
Sam Staton
USENIX
2008
13 years 9 months ago
Context-Aware Mechanisms for Reducing Interactive Delays of Energy Management in Disks
Aggressive energy conserving mechanisms can maximize energy efficiency, but often have the negative tradeoff of simultaneously reducing system responsiveness due to the switching ...
Igor Crk, Chris Gniady
FUIN
2007
116views more  FUIN 2007»
13 years 7 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
IEEEICCI
2008
IEEE
14 years 1 months ago
The computational manifold approach to consciousness and symbolic processing in the cerebral cortex
—A new abstract model of computation, the computational manifold, provides a framework for approaching the problems of consciousness, awareness, cognition and symbolic processing...
Douglas S. Greer
CALCO
2009
Springer
150views Mathematics» more  CALCO 2009»
14 years 2 months ago
Approximating Labelled Markov Processes Again!
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
Philippe Chaput, Vincent Danos, Prakash Panangaden...