Timers for Distributed Systems

Electronic Notes in Theoretical Computer Science - Tập 164 - Trang 81-99 - 2006
Gabriel Ciobanu1, Cristian Prisacariu1
1Institute of Computer Science, Romanian Academy, Blvd. Carol 8, 700505 Iaşi, Romania

Tài liệu tham khảo

Bengtsson, 2004, Timed automata: Semantics, algorithms and tools, 3098, 87 Berger, M., “Towards Abstractions for Distributed Systems”, Ph.D. Thesis, Imperial College, Department of Computing (2002) 2004 Felleisen, 1994, A syntactic approach to type soundness, Information and Computation, 115, 38, 10.1006/inco.1994.1093 Hennessy, 1995, A process algebra for timed systems, Information and Computation, 117, 221, 10.1006/inco.1995.1041 Hennessy, 2002, Resource Access Control in Systems of Mobile Agents, Information and Computation, 173, 82, 10.1006/inco.2001.3089 Laneve, 2005, Foundations of web transactions, 3441, 282 Lee, J. and J. Zic, On modeling real-time mobile processes, in: Proceedings 25th Australasian Conference on Computer Science (2002), pp. 139–147 Mills, 2003, A brief history of NTP time: memoirs of an internet timekeeper, Computer Communication Review, 33, 9, 10.1145/956981.956983 Milner, 1992, A calculus of mobile processes (i-ii), Information and Computation, 100, 1, 10.1016/0890-5401(92)90008-4 Milner, 1991, Co-induction in relational semantics, Theoretical Computer Science, 87, 209, 10.1016/0304-3975(91)90033-X Prisacariu, C. and G. Ciobanu, Timed distributed π-calculus, Technical Report FML-05-01, Formal Methods Laboratory, Institute of Computer Science, Romanian Academy (2005)