Handbook of theoretical computer science (vol. B)
Reasoning about infinite computations
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
A New One-Pass Tableau Calculus for PLTL
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
A Decision Algorithm for Full Propositional Temporal Logic
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
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
State Space Reductions for Alternating Büchi Automata
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Deductive Proof System for CTL
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Temporal Logic with Capacity Constraints
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Rules admissible in transitive temporal logic TS4, sufficient condition
Theoretical Computer Science
Alternation removal in büchi automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Reasoning and inference rules in basic linear temporal logic BLTL
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Model checking agent programs by using the program interpreter
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
A framework to compute inference rules valid in agents' temporal logics
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Enacting declarative languages using LTL: avoiding errors and improving performance
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Optimized temporal monitors for SystemC
RV'10 Proceedings of the First international conference on Runtime verification
Büchi store: an open repository of büchi automata
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Inference rules in multi-agents' temporal logics
Transactions on computational collective intelligence IV
A multi-encoding approach for LTL symbolic satisfiability checking
FM'11 Proceedings of the 17th international conference on Formal methods
Symbolic algorithm for generation büchi automata from LTL formulas
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Linear temporal logic with until and before on integer numbers, deciding algorithms
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Concepts of automata construction from LTL
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Truly on-the-fly LTL model checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
From PSL to LTL: a formal validation in HOL
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Deterministic dynamic monitors for linear-time assertions
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Larger automata and less work for LTL model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
A logical approach to data-aware automated sequence generation
Transactions on Computational Science XV
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
LTL to büchi automata translation: fast and more deterministic
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Nested Emptiness Search for Generalized Büchi Automata
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Optimized temporal monitors for SystemC
Formal Methods in System Design
International Journal of Intelligent Information Technologies
Behavioral diagnosis of LTL specifications at operator level
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On the relationship between LTL normal forms and Büchi automata
Theories of Programming and Formal Methods
Hardware implementation of BLTL property checkers for acceleration of statistical model checking
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
We improve the state-of-the-art algorithm for obtaining an automaton from a linear temporal logic formula. The automaton is intended to be used for model checking, as well as for satisfiability checking. Therefore, the algorithm is mainly concerned with keeping the automaton as small as possible. The experimental results show that our algorithm outperforms the previous one, with respect to both the size of the generated automata and computation time. The testing is performed following a newly developed methodology based on the use of randomly generated formulas.