Sciweavers

10072 search results - page 1477 / 2015
» Composition of Model Programs
Sort
View
ENTCS
2007
133views more  ENTCS 2007»
15 years 7 months ago
Modelchecking Correctness of Refactorings - Some Experiments
Refactorings are changes made to programs, models or specifications with the intention of improving their structure and thus making them clearer, more readable and re-usable. Ref...
H.-Christian Estler, Thomas Ruhroth, Heike Wehrhei...
IPL
2007
94views more  IPL 2007»
15 years 7 months ago
The finite horizon investor problem with a budget constraint
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
Asaf Levin
AUTOMATICA
2004
109views more  AUTOMATICA 2004»
15 years 7 months ago
Optimal stationary behavior for a class of timed continuous Petri nets
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
Bruno Gaujal, Alessandro Giua
ENTCS
2002
141views more  ENTCS 2002»
15 years 6 months ago
Coalgebraic Monads
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
Neil Ghani, Christoph Lüth, Federico De March...
ENTCS
2002
99views more  ENTCS 2002»
15 years 6 months ago
Greatest Bisimulations for Binary Methods
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
Hendrik Tews
« Prev « First page 1477 / 2015 Last » Next »