290 search results - page 31 / 58 » Logical Properties of Name Restriction |
PAPM
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...
EACL
2003
ACL Anthology
13 years 11 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
CADE
2012
Springer
12 years 11 days ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
FPGA
2004
ACM
14 years 3 months ago
2004
ACM
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
IANDC
2011
13 years 5 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...