In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
—This survey guides the reader through the extensive open literature that is covering the family of low-density paritycheck (LDPC) codes and their rateless relatives. In doing so...
We survey formal methods as they are applied to the development of communication services. We report on industrial and academic projects, consider di erent communication architect...
This paper describes the design of the OpenSTARS real-time analysis tool. The paper focuses on criteria for a good analysis tool including correctness, performance/scalability, fl...
Kevin Bryan, Tiegeng Ren, Jiangyin Zhang, Lisa Cin...
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...