Sciweavers

3044 search results - page 207 / 609
» Linear logical approximations
Sort
View
125
Voted
DLT
2004
15 years 5 months ago
An NP-Complete Fragment of LTL
A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NPcomplete. The fragment is larger than previously kn...
Anca Muscholl, Igor Walukiewicz
123
Voted
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
15 years 4 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith
107
Voted
ENTCS
2010
104views more  ENTCS 2010»
15 years 3 months ago
Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis
We report on the implementation and experimental analysis of an incremental multi-pass tableau-based procedure `a la Wolper for testing satisfiability in the linear time temporal ...
Valentin Goranko, Angelo Kyrilov, Dmitry Shkatov
139
Voted
CORR
2007
Springer
114views Education» more  CORR 2007»
15 years 3 months ago
A Sequent Calculus for Modelling Interferences
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in pro...
Christophe Fouqueré
115
Voted
DATE
2003
IEEE
159views Hardware» more  DATE 2003»
15 years 9 months ago
Model-Order Reduction Based on PRONY's Method
A new model-order reduction technique for linear dynamic systems is presented. The idea behind this technique is to transform the dynamic system function from the s-domain into th...
Makram M. Mansour, Amit Mehrotra