Reasoning and inference rules in basic linear temporal logic BLTL

Authors:
S. Babenyshev;V. Rybakov
Affiliations:
Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, UK and Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia;Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, UK and Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia
Venue:
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Year:
2010

Citing 19
Cited 0

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Logics of time and computation

Logics of time and computation
Temporal logic of programs

Temporal logic of programs
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Improved Automata Generation for Linear Temporal Logic

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Another Look at LTL Model Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Admissible Rules of Modal Logics

Journal of Logic and Computation
Proof Theory for Casari's Comparative Logics

Journal of Logic and Computation
Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series)

Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series)
Multi-modal and Temporal Logics with Universal Formula—Reduction of Admissibility to Validity and Unification*

Journal of Logic and Computation
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Proof Systems for a Gödel Modal Logic

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Admissible Rules of Łukasiewicz Logic

Journal of Logic and Computation
Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Bases of Admissible Rules of Łukasiewicz Logic

Journal of Logic and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our paper studies a formalization of reasoning in basic linear temporal logic BLTL in terms of admissible inference rules. The paper contains necessary preliminary information and description of new evolved technique allowing by a sequence of mathematical lemmas to get our main result. Main result is found explicit basis for rules admissible in BLTL (which, in particular, allows to compute admissible rules).