Filters








26,957 Hits in 3.5 sec

Unambiguity in Timed Regular Languages: Automata and Logics [chapter]

Paritosh K. Pandya, Simoni S. Shah
2010 Lecture Notes in Computer Science  
We propose a deterministic and unary variant of MTL called DUMTL and show that DUMTL formulae can be reduced to language equivalent po2DTA in polynomial time, giving NPcomplete satisfiability for the logic  ...  A subclass of the two-way deterministic timed automata (2DTA) of Alur and Henzinger, called partially-ordered two-way deterministic automata (po2DTA) are examined and we call the languages accepted by  ...  Moreover, Etessami et al [EVW02] showed that UL are precisely the languages definable by the Unary Temporal Logic, UTL, which is linear temporal logic using only the modalities − → 3 and ← − 3 .  ... 
doi:10.1007/978-3-642-15297-9_14 fatcat:dqjhqbzobrbu5iz7zcr3mh6uba

Real Time Temporal Logic: Past, Present, Future [chapter]

Oded Maler, Dejan Nickovic, Amir Pnueli
2005 Lecture Notes in Computer Science  
On the other hand we provide a proof that certain languages expressed in the future fragment of MITL are not deterministic, 4 and analyze the reason for this asymmetry.  ...  This paper attempts to improve our understanding of timed languages and their relation to timed automata.  ...  Tripakis and Y. Lakhnech and from comments made by D. Fisman, T. Henzinger and anonymous referees.  ... 
doi:10.1007/11603009_2 fatcat:xyskxkorjbcvncuu7sob3rjyb4

Cumulative subject index volumes 64–67

1985 Information and Control  
, 66, 29 temporal, future perfect expressive power, 67, 23 Logical relations typed 2-calculus, 65, 85 Looping restrictions, in alternating Turing machines, 67, 2 M Machines Turing, see Turing  ...  correctness formulas, for simple loop programs, 65, 18 Expressive power future perfect, in temporal logics, 67, 23 F Flowcharts propositional dynamic logic, 64, 119 Formulas correctness, and  ... 
doi:10.1016/s0019-9958(85)80038-3 fatcat:cnfpoerj4bgahkwbjf5nrkty5e

Page 2192 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
Reynolds (5-MURD-IT; Murdoch) 03 MATHEMATICAL LOGIC AND FOUNDATIONS 2001d:03046 03B44 03D05 68Q45 Schmitz, Heinz (D-WRZB-TI; Wiirzburg) Restricted temporal logic and deterministic languages.  ...  Summary: “In formulas of restricted temporal logic (RTL) arbi- trary use of the temporal operators next(X) and eventually(F), and of Boolean connectives is allowed.  ... 

From Syntax to Semantics in Systems Biology Towards Automated Reasoning Tools [chapter]

François Fages
2006 Lecture Notes in Computer Science  
in temporal logic [9] .  ...  The most original feature of BIOCHAM is its use in both cases of a powerful language based on temporal logic to formalize the biological properties of the model.  ...  It has been supported by the ARC CPBIO2 2 and is now partly supported by the European STREP project APRIL II3 3 and the European Network of Excellence REWERSE4 4 .  ... 
doi:10.1007/11732488_6 fatcat:og573cyqbvhbtfpezmop6lifmi

Page 7786 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
Chapter 2 describes certain automata, their expressive power, non-deterministic versus deterministic automata, and their relation to games.  ...  METATEM is really a paradigm for programming 03 MATHEMATICAL LOGIC AND FOUNDATIONS 7786 languages rather than one particular language.  ... 

Run-time monitoring and recovery of Harel statecharts using prioritized non-deterministic statechart specifications

D. Drusinsky
2005 48th Midwest Symposium on Circuits and Systems, 2005.  
nondeterministic statecharts and metric temporal logic.  ...  The StateRover integrates prioritized non-deterministic statechart specifications with deterministic UML-statecharts thereby enabling run-time recovery of deterministic statecharts upon violation of formal  ...  Published REM methods typically use temporal logic, Metric Temporal Logic (MTL), and regular expressions as a specification language [D1] .  ... 
doi:10.1109/mwscas.2005.1594104 fatcat:734io5uwrrgkpjg42fcnjgt3ay

On the expressive power of temporal logic

Joëlle Cohen, Dominique Perrin, Jean-Eric Pin
1993 Journal of computer and system sciences (Print)  
Our main result states a similar condition for the "restricted" temporal logic (RTL), obtained by discarding the "until" operator.  ...  We first give a transparent proof of the fact that a formal language is expressible in this logic if and only if its syntactic semigroup is finite and aperiodic.  ...  We have given an effective characterization of the languages definable in linear propositional temporal logic and in restricted temporal logic.  ... 
doi:10.1016/0022-0000(93)90005-h fatcat:ricjslzjpne4ppbpyseo4wtwu4

A Decidable Dense Branching-Time Temporal Logic [chapter]

Salvatore La Torre, Margherita Napoli
2000 Lecture Notes in Computer Science  
We show this result by reducing this problem to the emptiness problem of timed tree automata, so strengthening the already well-founded connections between nite automata and temporal logics.  ...  Timed computation tree logic (Tctl) extends Ctl by allowing timing constraints on the temporal operators. The semantics of Tctl is de ned on a dense tree.  ...  Acknowledgements We would like to thank Rajeev Alur for the helpful discussions and suggestions.  ... 
doi:10.1007/3-540-44450-5_11 fatcat:phpxxuaxtvh5ppojm2wsplisaq

Encoding Definitional Fragments of Temporal Action Logic into Logic Programming

Marc van Zee, Patrick Doherty, John-Jules Ch. Meyer
2014 European Conference on Artificial Intelligence  
Temporal Action Logics (TAL) is an expressive class of nonmonotonic temporal logics for reasoning about action and change.  ...  Although quite restrictive, this sets the lower bound on what can be done with direct mappings to logic programs. Discussions concerning extensions to the restricted fragment are also provided.  ...  Introduction Temporal Action Logics (TAL) [2, 4] is a general class of nonmonotonic temporal logics for reasoning about action and change that are based on the Features and Fluents framework of Sandewall  ... 
dblp:conf/ecai/ZeeDM14 fatcat:wi7jgct3xjeklfc5ygbae3dmx4

Page 8274 of Mathematical Reviews Vol. , Issue 2001K [page]

2001 Mathematical Reviews  
Summary: “In this paper we analyze declarative deterministic and non-deterministic semantics for active rules.  ...  In this declarative system, methods are specified in a high-level, temporal constraint language.  ... 

Verifying temporal properties without temporal logic

Bowen Alpern, Fred B. Schneider
1989 ACM Transactions on Programming Languages and Systems  
An approach to proving temporal properties of concurrent programs that does not use temporal logic as an inference system is presented.  ...  These obligations are discharged by devising suitable invariant assertions and variant functions for the program. The approach is shown to be sound and relatively complete.  ...  Panangaden, and A. Pnueli made helpful comments on an earlier draft of this paper.  ... 
doi:10.1145/59287.62028 fatcat:el3hbsoq4zdx3p3ibitswpbkgu

Executable Temporal Logic Systems

1996 Journal of symbolic computation  
Unlike most logic-based languages, it is very deterministic and offers no facilities for backtracking. This approach has been adapted primarily for execution efficiency.  ...  Chronolog and Concurrent MetateM use linear-time temporal logic, while Tempura and Tokio use interval temporal logic and F-Limette uses metric temporal logic.  ... 
doi:10.1006/jsco.1996.0073 fatcat:irywl2eukzh6xjuqpcbfqyesri

Page 146 of Journal of Research and Practice in Information Technology Vol. 25, Issue 4 [page]

1993 Journal of Research and Practice in Information Technology  
HAREL, E., LICHTENSTEIN, O. and PNUELI, A. (1990): Explicit Clock Temporal Logic, Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science: 402-413, June.  ...  ARNOLD, A.(1984): Deterministic and non-deterministic rational w-lan- guages, Lecture Notes in Computer Science 192, pp.18-27, Springer- Verlag, NY.  ... 

Page 7263 of Mathematical Reviews Vol. , Issue 87m [page]

1987 Mathematical Reviews  
R. (1-MIT) Can message buffers be axiomatized in linear temporal logic? Inform. and Control 63 (1984), no. 1-2, 88-112.  ...  Each such sequence can be viewed as a structure in which temporal logic formulas can be given truth values.  ... 
« Previous Showing results 1 — 15 out of 26,957 results