Shortest Counterexamples for Symbolic Model Checking of LTL With Past
Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-31980-1_32
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2005
Authors
Publisher
Springer Berlin Heidelberg