Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
Abstract. Although Ada defines a number of mechanisms for specifying scheduling policies, only one, Fifo Within Priorities is guaranteed to be supported by all implementations of ...
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Abstract. Flexibility to react on rapidly changing general conditions of the environment has become a key factor for economic success of any company. The competitiveness of an ente...
Abstract. UnifyingTheoriesofProgramming(UTP)canprovideaformalsemantic foundation not only for programming languages but also for more expressive specification languages. We believ...