Design and control of recycle systems must be integrated at an early design stage. By placing together the pieces of the design puzzle we developed a novel methodology that allows...
Anton A. Kiss, Costin S. Bildea, Alexandre C. Dimi...
Abstract—Service requests are the origin of every service provisioning process and therefore the entities to be considered first. Similar to Physics and Engineering Sciences, ser...
We provide a category theoretic reformulation of control structures, which avoids explicit reference to names. The basis of the formulation is what we call a binding structure, wh...
In any learnability setting, hypotheses are conjectured from some hypothesis space. Studied herein are the influence on learnability of the presence or absence of certain control ...
In the visual programming domain, the stress of research is laid on the use of visual formalism, which is considered to be more intuitive than the textual formalism, in the progra...
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
This paper develops some control structures suitable for composing fault-tolerant distrib uted applications using atomic actions (atomic transactions) as building blocks, and then...
Little-JIL, a new language for programming the coordination of agents is an executable, high-level process programming language with a formal (yet graphical) syntax and rigorously...
Alexander E. Wise, Aaron G. Cass, Barbara Staudt L...
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...