Publications
De publicaties worden automatisch opgehaald en weergegeven vanuit de centrale repository, zodat bezoekers op je eigen site eenvoudig toegang hebben tot de meest recente wetenschappelijke publicaties, artikelen en rapporten. Bezoekers zoeken eenvoudig op trefwoord om snel de publicaties te vinden die relevant zijn.
- pubyear
- 2013
- creators
- Verriet, J.; Liang, H.L.; Hamberg, R.; Wijngaarden, B. van
Model-Driven development of logistic systems using domain-specific tooling
- pubyear
- 2013
- creators
- Bhattacharyya, S.S.; Deprettere, E.F.; Theelen, B.D.
Dynamic dataflow graphs
Much of the work to date on dataflow models for signal processing system design has focused on decidable dataflow models that are best suited for one-dimensional signal processing. This chapter reviews more general dataflow modeling techniques that are targeted to applications that include multidimensional signal processing and dynamic dataflow behavior.
- pubyear
- 2013
- creators
- Muller, G.
Formula based performance design
Performance models are mostly simple mathematical formulas. The challenge is to model the performance at an appropriate level. In this presentation we introduce several levels of modeling, labeled zeroth order, second order, et cetera. AS illiustration we use the performance of MRI reconstruction.
- pubyear
- 2013
- creators
- Damavandpeyma, M.; Stuijk, S.; Basten, T.; Geilen, M.; Corporaal, H.
Throughput-constrained DVFS for scenario-aware dataflow graphs
Dynamic behavior of streaming applications can be effectively modeled by scenario-aware dataflow graphs (SADFs). Many streaming applications must provide timing guarantees (e.g., throughput) to assure their quality-of-service. For instance, a video decoder which is running on a mobile device is expected to deliver a video stream with a specific frame rate.
- pubyear
- 2013
- creators
- Geilen, M.; Basten, T.
Kahn process networks and a reactive extension
Kahn and MacQueen have introduced a generic class of determinate asynchronous data-flow applications, called Kahn Process Networks (KPNs) with an elegant mathematical model and semantics in terms of Scott-continuous functions on data streams together with an implementation model of independent asynchronous sequential programs communicating through FIFO buffers with blocking read and non-blocking write operations.
- pubyear
- 2012
- creators
- Hamberg, R.; Verriet, J.; Schuddemat, J.
Reflections on the falcon project
This chapter reflects on Falcon, a project to advance automation inwarehouses. Its main results and their impact as well as the project’s process arediscussed. The impact of Falcon on its industrial partners mainly concern model-based methods, of which strengthening the inception of the new architecture forsystem-level control of warehouses is a good example.
- pubyear
- 2012
- creators
- Hamberg, R.
Model support for new warehouse concept development
- pubyear
- 2012
Automation in Warehouse Development
The warehouses of the future will come in a variety of forms, but with a few common ingredients. Firstly, human operational handling of items in warehouses is increasingly being replaced by automated item handling. Extended warehouse automation counteracts the scarcity of human operators and supports the quality of picking processes.
- pubyear
- 2012
From scientific instrument to industrial machine : Coping with architectural stress in embedded systems
Architectural stress is the inability of a system design to respond to new market demands. It is an important yet often concealed issue in high tech systems. In From scientific instrument to industrial machine, we look at the phenomenon of architectural stress in embedded systems in the context of a transmission electron microscope system built by FEI Company.
- pubyear
- 2012
- creators
- Ghasemieh, H.; Remke, A.; Haverkort, B.; Gribaudo, M.
Region-based analysis of hybrid Petri nets with a single general one-shot transition
Recently, hybrid Petri nets with a single general one-shot transition (HPnGs) have been introduced together with an algorithm to analyze their underlying state space using a conditioning/deconditioning approach. In this paper we propose a considerably more efficient algorithm for analysing HPnGs. The proposed algorithm maps the underlying state-space onto a plane for all possible ring times of the general transition s and for all possible systems times t.