Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Formally analyzing software architectural specifications using SAM
Journal of Systems and Software
Neural-symbolic intuitionistic reasoning
Design and application of hybrid intelligent systems
From linear time to branching time
ACM Transactions on Computational Logic (TOCL)
A practical approach for monitoring analog circuits
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Imcompleteness of States w.r.t traces in model Checking
Information and Computation
Connectionist computations of intuitionistic reasoning
Theoretical Computer Science
Foundations of incremental aspect model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Specify, Compile, Run: Hardware from PSL
Electronic Notes in Theoretical Computer Science (ENTCS)
Embedding finite automata within regular expressions
Theoretical Computer Science
Explaining Counterexamples Using Causality
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Incompleteness of states w.r.t. traces in model checking
Information and Computation
On the distributivity of LTL specifications
ACM Transactions on Computational Logic (TOCL)
Fault localization and correction with QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
PSL for runtime verification: theory and practice
RV'07 Proceedings of the 7th international conference on Runtime verification
The common fragment of ACTL and LTL
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On the expressive power of live sequence charts
Program analysis and compilation, theory and practice
Some results on the expressive power and complexity of LSCs
Pillars of computer science
Making prophecies with decision predicates
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On decidability of LTL model checking for process rewrite systems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
An abstract interpretation perspective on linear vs. branching time
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Journal of Computer and System Sciences
Temporal logic for scenario-based specifications
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
The complexity of live sequence charts
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Weakly-Synchronized ground tree rewriting
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
It is well-known that CTL (computation tree logic) and LTL (linear time logic) have incomparable expressive power. In this paper, we give an inductive definition of those ACTL (Action-based CTL) formulas that can be expressed in LTL. In addition, we obtain a procedure to decide whether an ACTL formula lies in LTL, and show that this problem is PSPACE-complete. By omitting path quantifiers, we get an inductive definition of the LTL formulas that are expressible in ACTL. We can show that the fragment defined by our logic represents exactly those LTL formulas the negation of which can be represented by a 1-weak Bu/spl uml/chi automaton and that, for this fragment, the representing automaton can be chosen to be of size linear in the size of the formula.