We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Although programs convey an unambiguous meaning, the grammars used in practice to describe their syntax are often ambiguous, and completed with disambiguation rules. Whether these...
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
We propose String MultiSet Rewriting (SMSR) as an intermediate language for simulation of biomolecular systems. Higher level formalisms for biological systems description can be t...
Roberto Barbuti, Giulio Caravagna, Andrea Maggiolo...
We introduce a general model of refinement. This is defined in terms of what contexts an entity can appear in, and what observations can be made of it in those contexts. We show e...