We study an operator for refinement of actions to be used in the design of concurrent systems. Actions on a given level of abstraction are replaced by...
Codings of fair sticker languages are characterized as languages accepted by blind one-counter automata.
The class Steiner minimal tree problem is an extension of the standard Steiner minimal tree problem in graphs, motivated by the problem of wire routin...
We present a comprehensive refinement calculus for the development of sequential, real-time programs from real-time specifications. A specification ma...
A bunch is a simple data structure, similar in many respects to a set. However, bunches differ from sets in that the data is not packaged up or encaps...
