Filters








32,618 Hits in 8.3 sec

On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics [chapter]

F. Laroussinie, Ph. Schnoebelen, M. Turuani
2000 Lecture Notes in Computer Science  
We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discretetime framework, and study the expressive power of several relevant logics  ...  When only subscripted modalities are used, polynomial-time model checking is possible even for the largest logic we consider, while introducing freeze quanti ers leads to a complexity blow-up.  ...  Conclusion We investigated the expressive power and the complexity of model checking for TCTL s and TCTL c , two quantitative extensions of CTL along the lines of RTCTL EMSS91, ET99] .  ... 
doi:10.1007/10719839_43 fatcat:w6qk7a2v4zhe7btyncc4wwzj5q

On the expressivity and complexity of quantitative branching-time temporal logics

F. Laroussinie, Ph. Schnoebelen, M. Turuani
2003 Theoretical Computer Science  
We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discrete-time framework, and study the expressive power of several relevant logics  ...  When only subscripted modalities are used, polynomial-time model checking is possible even for the largest logic we consider, while the introduction of freeze quantiÿers leads to a complexity blow-up.  ...  While temporal logics only deal with "before and after" properties, realtime temporal logics and more generally quantitative temporal logics aim at expressing quantitative properties of the time elapsed  ... 
doi:10.1016/s0304-3975(02)00644-8 fatcat:jdtnxwvfozfc5mhzxmqpcst4ni

A Survey on Temporal Logics [article]

Savas Konur
2011 arXiv   pre-print
This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability  ...  (or undecidability) results, expressiveness and proof systems.  ...  Expressiveness of Branching Temporal Logics One of the main reasons of using branching time logics is that the model-checking procedure is very efficient.  ... 
arXiv:1005.3199v3 fatcat:nogsv2iggvd5likbkrnmnzpsdu

A survey on temporal logics for specifying and verifying real-time systems

Savas Konur
2013 Frontiers of Computer Science  
Over the last two decades, there has been an extensive study of logical formalisms on specifying and verifying real-time systems.  ...  Although numerous logics have been introduced for formal specification of real-time and complex systems, an up to date survey of these logics does not exist in the literature.  ...  Some parts of this paper exists in [231] .  ... 
doi:10.1007/s11704-013-2195-2 fatcat:5lyaji5wnzbyfdmbxwzbxjosku

Real-time and Probabilistic Temporal Logics: An Overview [article]

Savas Konur
2011 arXiv   pre-print
Although numerous logics have been introduced for the formal specification of real-time and complex systems, an up to date comprehensive analysis of these logics does not exist in the literature.  ...  Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems.  ...  This results in a very expressive language, and allows to write very complex quantitative constraints. This makes this logic very useful in real-time system specification.  ... 
arXiv:1005.3200v3 fatcat:xhrrcy26bzeehg7wqvjfikm26e

Temporal patterns and modal structure

J van Benthem
1999 Logic Journal of the IGPL  
(description of tenses and other temporal expressions in natural languages), and to some extent also mathematics (theory of linear and branching orders, non-point-based geometries).  ...  Temporal logic arose at the border of philosophy and linguistics.  ...  Reification of Paths and Branches in Temporal Logic Another prime candidate for reification in temporal logic arises in so-called 'branching time' (cf. Section 2.3).  ... 
doi:10.1093/jigpal/7.1.7 fatcat:cjkmqmzoyvh3zl7lw2s7jzpclu

Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond

Alessandro Aldini
2020 Electronic Proceedings in Theoretical Computer Science  
Quantitative aspects of computation are related to the use of both physical and mathematical quantities, including time, performance metrics, probability, and measures for reliability and security.  ...  In the same period, they represented the central theme of the series of workshops entitled Quantitative Aspects of Programming Languages and Systems (QAPL) and born in 2001.  ...  Several studies concern extensions of classical linear-time and branching-time logics.  ... 
doi:10.4204/eptcs.312.1 fatcat:4fjvygbppjbq3k5ury2kvue3nq

Page 3556 of Mathematical Reviews Vol. , Issue 2002E [page]

2002 Mathematical Reviews  
Summary: “We define a quantitative temporal logic that is based on a simple modality within the framework of monadic predicate logic.  ...  Time and space complexity are not discussed. A prototype system based on the synthesis algorithm is presented.  ... 

Quantitative temporal reasoning

E. A. Emerson, A. K Mok, A. P. Sistla, J. Srinivasan
1992 Real-time systems  
We propose a system of temporal logic, RTCI'L (Real-Time Computation Tree Logic), that allows the melding of qualitative temporal assertions together with real-time constraints to permit specification  ...  and reasoning at the twin levels of abstraction: qualitative and quantitative.  ...  One disadvantage of CTL and other extant temporal logics, however, is that they lack the ability to express properties of programs related to real-time.  ... 
doi:10.1007/bf00355298 fatcat:uolh4gpthzdw3ox3mqptgcucay

Branching vs. Linear Time: Final Showdown [chapter]

Moshe Y. Vardi
2001 Lecture Notes in Computer Science  
One of the beliefs dominating this discussion has been that "while specifying is easier in LTL (linear-temporal logic), verification is easier for CTL (branching-temporal logic)".  ...  The discussion of the relative merits of linear-versus branching-time frameworks goes back to early 1980s.  ...  The complexity of model checking for both linear and branching temporal logics is well understood: suppose we are given a transition system of size n and a temporal logic formula of size m.  ... 
doi:10.1007/3-540-45319-9_1 fatcat:2i2vgpeuzfabtj66rylhspbn5y

Verification methods for finite systems [chapter]

Ahmed Bouajjani, Joseph Sifakis
1991 Lecture Notes in Computer Science  
The increasing complexity of concurrent systems requires the development of rigorous design methods.  ...  This need has motivated research on specification formalisms and the associated verification methods and tools. By verification, we mean the comparison of a system against its specifications.  ...  The logic-based specification languages presented are the propositional temporal logics PTL for linear time and CTL for branching time.  ... 
doi:10.1007/3540539816_59 fatcat:so4l25s75faspeiiwg5ygoamle

Model Revision from Temporal Logic Properties in Computational Systems Biology [chapter]

François Fages, Sylvain Soliman
2008 Lecture Notes in Computer Science  
We first present a model revision algorithm for inferring reaction rules from biological properties expressed in temporal logic.  ...  In this chapter, we present qualitative and quantitative logic learning tools, and illustrate how they can be useful to the modeler.  ...  The authors would like to thank Stephen Muggleton and Luc de Raedt for extensive discussions on the topics of this paper, and Nathalie Chabrier-Rivier and Laurence Calzone for their contributions.  ... 
doi:10.1007/978-3-540-78652-8_11 fatcat:dihxvyyxezdnxddf4yifd4ekyq

Page 1441 of Mathematical Reviews Vol. , Issue 2000b [page]

2000 Mathematical Reviews  
In this article the author investigates the expressive and distinguish- ing powers of a number of variants of linear and branching-time temporal logics.  ...  The temporal logic BPLTL (branching past linear temporal logic) is introduced. A sound and relatively complete proof system for the logic over program transitions is given. M. A.  ... 

Probabilistic verification and approximation

Richard Lassaigne, Sylvain Peyronnet
2008 Annals of Pure and Applied Logic  
Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas.  ...  We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems.  ...  Acknowledgements We would like to thank Thomas Hérault for his important participation to the development of APMC, and an anonymous referee for his pertinent remarks and suggestions.  ... 
doi:10.1016/j.apal.2007.11.006 fatcat:kjhhgvh6prglxehlpepy42afju

Some issues in real-time systems verification using time Petri Nets

Pedro M. González del Foyo, José Reinaldo Silva
2011 Journal of the Brazilian Society of Mechanical Sciences and Engineering  
Time Petri Net (TPN) models have been widely used to the specification and verification of real-time systems.  ...  must be able to check timing properties, both safe and behavioral, and ii) the underlying algorithm must be efficient enough to be applied to complex systems design.  ...  Acknowledgements We thank CAPES for the partial support to the research that resulted in this article.  ... 
doi:10.1590/s1678-58782011000400010 fatcat:o4u53fojcrgm7dpwmtgqskyxpy
« Previous Showing results 1 — 15 out of 32,618 results