Xiuting Tao

  • Citations Per Year
Learn More
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Processes) and nBPA (normed Basic Process Algebras). These results lead to the question if there are any other models in the hierarchy of PRS (Process Rewrite Systems) whose branching bisimilarity is decidable. It is shown in this paper that the branching(More)
We introduce a model named nested updatable timed automata (NeUTAs), which can be regarded as a combination of nested timed automata (NeTAs) and updatable timed automata with one updatable clock (UTA1s). The model is suitable for soft real-time system analysis, since the updatable clock representing a deadline can be updated due to environments. A NeUTA(More)
Exchange protocols are an important theoretic basis to make secure electronic commerce and electronic business transactions possible, in which the fairness is a crucial property. To ensure and verify the property, a specific model is proposed, based on the extensive game with imperfect information. Fairness is built in the protocol game and the(More)
  • 1