TCS / Research / Publications / Deadlock and Reachability Checking with Finite Complete Prefixes
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Deadlock and Reachability Checking with Finite Complete Prefixes

Reference:

Keijo Heljanko. Deadlock and Reachability Checking with Finite Complete Prefixes. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999.

Suggested BibTeX entry:

@phdthesis{HeljankoLic,
    author = {Heljanko, Keijo},
    school = {Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science},
    title = {Deadlock and Reachability Checking with Finite Complete Prefixes},
    type = {Licentiate's thesis},
    year = {1999},
}

See www.tcs.hut.fi ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.