Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic.

Danièle Beauquier Tristan Crolard Evguenia Prokofieva Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic. 372-387 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2988&spage=372 2004 conf/tacas/2004 TACAS db/conf/tacas/tacas2004.html#BeauquierCP04