未找到相关数据
Timed tree automata with an application to temporal logic
被引：0
作者：
Salvatore La Torre
Margherita Napoli
机构：
[1] University of Pennsylvania,
[2] Department of Computer and Information Science,undefined
[3] Philadelphia,undefined
[4] PA 19104,undefined
[5] USA,undefined
[6] Università degli Studi di Salerno,undefined
[7] Dipartimento di Informatica ed Applicazioni,undefined
[8] 84081 Baronissi,undefined
[9] Italy (e-mail: {sallat,undefined
[10] napoli}@unisa.it),undefined
来源：
Acta Informatica
|
2001年
/
38卷
关键词：
Timing Constraint;
Decision Problem;
Temporal Logic;
Main Motivation;
Finite Automaton;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Finite automata on \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}
$\omega$\end{document}-sequences and \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}
$\omega$\end{document}-trees were introduced in the sixties by Büchi, McNaughton and Rabin. Finite automata on timed \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}
$\omega$\end{document}-sequences were introduced by Alur and Dill. In this paper we extend the theory of timed \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}
$\omega$\end{document}-sequences to \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}
$\omega$\end{document}-trees. The main motivation is the introduction of a new way to specify real-time systems and to study, using automata-theoretic techniques, branching-time temporal logics with timing constraints. We study closure properties and decision problems for the obtained classes of timed \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}
$\omega$\end{document}-tree languages. In particular, we show the decidability of the emptiness problem. As an application of the introduced theory, we give a new decidable branching time temporal logic (STCTL) whose semantics is based upon timed \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}
$\omega$\end{document}-trees.
引用
收藏
页码：89 / 116
页数：27
相关论文