The complexity of propositional linear temporal logics in simple cases
Information and Computation
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
The Complexity of Poor Man's Logic
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Optimal Complexity Bounds for Positive LTL Games
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Deterministic generators and games for Ltl fragments
ACM Transactions on Computational Logic (TOCL)
Declarative specification and verification of service choreographiess
ACM Transactions on the Web (TWEB)
| Hi-index | 0.00 |