进程同步临界区问题Peterson算法证明。通过模拟各种可能的操作序列来正明Peterson算法的正确性。详见：http://blog.csdn.net/zha_1525515/archive/2009/10/27/4733056.aspx-Critical zone in the process of synchronization algorithm for proof of Peterson. By simulating every possible sequence of actions

上下班打卡功能（上班打卡，下班打卡，管理员可进行跟换时间打卡，） -Punch card to work function (work punch card, punch work, administrators can be changed with time, clocking,)