Home > Seminars > [Decidability in petri net and presburger arithmetic]
2011
November 15, 2011. Room 3-318 Dianxin Building. 1:30 pm.
The general vector addition system reachability problem by presburger inductive invariants
(Jerome Leroux). Speaker: Dr. Chaodong He
December 4, 2011. Room 3-318 Dianxin Building. 1:pm.
Complexity of Presburger Arithmetic - Upper Bounds
. Speaker: Dr. Huan Long
October 27, 2011. Room 3-318 Dianxin Building. 9:am.
Complexity of Presburger Arithmetic - Lower Bounds
. Speaker: Dr. Huan Long
October 19, 2011. Room 3-318 Dianxin Building. 1:00pm.
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
(Mohamed Faouzi Atig, Ahmed Bouajjani, and Shaz Qadeer 2009). Speaker: Dr. Xiaojuan Cai
October 13, 2011. Room 3-318 Dianxin Building. 9:00am.
Presburger Arithmetic. Speaker: Prof. Yuxi Fu
September 29, 2011. Room 3-318 Dianxin Building. 9:00am.
Decidabiity of reachability in vector addition systems(S. Rao Kosaraju 1982). Speaker: Prof. Yuxi Fu
September 22, 2011. Room 3-318 Dianxin Building. 9:00am.
Decidabiity of reachability in vector addition systems(S. Rao Kosaraju 1982). Speaker: Prof. Yuxi Fu