On the Complexity of Temporal-Logic Path Checking
Attributed to:
Model-Checking Algorithms for Timed Systems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-662-43951-7_8
Publication URI: http://dx.doi.org/10.1007/978-3-662-43951-7_8
Type: Book Chapter
Book Title: Automata, Languages, and Programming (2014)
Page Reference: 86-97
ISBN: 978-3-662-43950-0