We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a ...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
Enterprise and data center networks consist of a large number of complex networked applications and services that depend upon each other. For this reason, they are difficult to ma...
Lucian Popa 0002, Byung-Gon Chun, Ion Stoica, Jaid...
Although there has been significant research into gender regarding educational and workplace practices, there has been little investigation of gender differences pertaining to pro...
Margaret M. Burnett, Scott D. Fleming, Shamsi Iqba...
There is an increasing need for sharing data repositories containing personal information across multiple distributed and private databases. However, such data sharing is subject t...