Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
WSBPEL [2] opens up the possibility of applying a range of formal techniques to the verification of Web service behaviors from two points of view: constraints between activities w...
IP traceback can be used to find the origin of anonymous traffic; however, Internet-scale IP traceback systems have not been deployed due to a need for cooperation between Interne...
We consider the N-user broadcast erasure channel where feedback from the users is fed back to the transmitter in the form of ACK messages. We provide a generic outer bound to the ...