Filters








87,443 Hits in 9.4 sec

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

Savas Konur
2011 arXiv   pre-print
Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems.  ...  We extrapolate the notions of decidability, axiomatizability, expressiveness, model checking, etc. for each logic analysed. We also provide a comparison of features of the temporal logics discussed.  ...  There are two main approaches: extending classical logic with probabilistic operators (such as modal logic of knowledge in [27] ); combining probabilistic approach with non-classical logics (probabilistic  ... 
arXiv:1005.3200v3 fatcat:xhrrcy26bzeehg7wqvjfikm26e

Automatic Verification of Hybrid Systems with Large Discrete State Space [chapter]

Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz
2006 Lecture Notes in Computer Science  
These techniques are integrated within a model checker for universal CTL. Technically, it deals with discrete-time hybrid systems with linear differentials.  ...  two configurations.  ...  HySAT [9] is a bounded model checker for linear hybrid systems.  ... 
doi:10.1007/11901914_22 fatcat:3ke6rvnscjalvc7xvc3uoeqalm

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  ...  In [91] partial-order reduction techniques are applied to linear and branching time temporal logics for knowledge (without the next operator) to reduce the model size before applying model checking procedure  ...  Although model checking is expensive in linear time logics (for example, it is exponential for LTL), model checking complexity of CTL is very efficient, which is linear in the size of model and formula  ... 
arXiv:1005.3199v3 fatcat:nogsv2iggvd5likbkrnmnzpsdu

Bounded LTL model checking with stable models

KEIJO HELJANKO, ILKKA NIEMELÄ
2003 Theory and Practice of Logic Programming  
The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic  ...  It is shown how a 1-safe Petri net and a requirement on the behavior of the net can be translated into a logic program such that the bounded model checking problem for the net can be solved by computing  ...  There are also alternative semantics to the two presented in this work [10] , applying them to bounded LTL model checking is left for further work.  ... 
doi:10.1017/s1471068403001790 fatcat:urpk7dnaazc3lmicp4grjn73cq

Page 2074 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
Model-checking for CTL turns out to be decidable in linear time and validity is EXPTIME-complete.  ...  This informative, essentially expository article seeks to find ex- planations for the decidability (even tractability, sometimes) of model-checking and validity in a variety of modal logics with possible-worlds  ... 

Bounded LTL Model Checking with Stable Models [chapter]

Keijo Heljanko, Ilkka Niemelä
2001 Lecture Notes in Computer Science  
The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic  ...  It is shown how a 1-safe Petri net and a requirement on the behavior of the net can be translated into a logic program such that the bounded model checking problem for the net can be solved by computing  ...  There are also alternative semantics to the two presented in this work [10] , applying them to bounded LTL model checking is left for further work.  ... 
doi:10.1007/3-540-45402-0_15 fatcat:kl3sbhtflfcx5koj5vcut6syhi

Combined model checking for temporal, probabilistic, and real-time logics

Savas Konur, Michael Fisher, Sven Schewe
2013 Theoretical Computer Science  
However, the development of new model checking tools for complex combinations of logics is both difficult and time consuming.  ...  In this article, we show how model checkers for the constituent temporal, probabilistic, and real-time logics can be re-used in a modular way when we consider combined logics involving different dimensions  ...  We would also like to thank Simon Dobson and Stephen Knox for providing the Scatterbox application and helpful discussions during the modelling of the system.  ... 
doi:10.1016/j.tcs.2013.07.012 fatcat:cjs5zxzwkrhoxh2qb7to7hevcy

Formal verification of analog and mixed signal designs: A survey

Mohamed H. Zaki, Sofiène Tahar, Guy Bois
2008 Microelectronics Journal  
Due to challenges associated with its verification process, AMS designs require a considerable portion of the total design cycle time.  ...  Researchers started lately studying the applicability of formal methods for the verification of AMS systems as a way to tackle the limitations of conventional verification methods like simulation.  ...  They use the techniques along with symbolic manipulation analysis for the bounded model checking of safety and liveness properties.  ... 
doi:10.1016/j.mejo.2008.05.013 fatcat:527gyri32nd3vjmnfavyiud36m

Formal Approaches to Modelling and Verifying Resource-bounded Agents-state of the Art and Future Prospects

Abdur Rakib
2012 Journal of Information Technology & Software Engineering  
Citation: Rakib A (2012) Formal Approaches to Modelling and Verifying Resourcebounded Agents─state of the Art and Future Prospects. J Inform Tech Softw Eng 2:e109.  ...  There is a growing body of work where the agent's deduction steps are explicitly modelled in the logic, for example [4] [5] [6] , which makes it possible to model the time it takes the agent to arrive  ...  To give readers an idea on the existing body of research on epistemic logics and verification of resource bounded multi-agent systems, we present state of the art formal approaches to modelling and verifying  ... 
doi:10.4172/2165-7866.1000e109 fatcat:tgrwjtf5jvfphj3sl2sfvh3kpm

Statistical Model Checking : An Overview [article]

Axel Legay, Benoit Delahaye
2010 arXiv   pre-print
The model checking problem for stochastic systems with respect to such logics is typically solved by a numerical approach that iteratively computes (or approximates) the exact measure of paths satisfying  ...  Another approach to solve the model checking problem is to simulate the system for finitely many runs, and use hypothesis testing to infer whether the samples provide a statistical evidence for the satisfaction  ...  Acknowledgments We would like to thanks our collaborators on the statistical model checking project: Sumit Jha, Marius Bozga, Saddeck Bensalem.  ... 
arXiv:1005.1327v1 fatcat:vwkiw5bjmfcddlkc43mlcxijai

Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic [chapter]

Xiaowei Huang, Cheng Luo, Ron van der Meyden
2011 Lecture Notes in Computer Science  
The paper identifies a number of inefficiencies in prior encodings for bounded model checking for a logic of knowledge and branching time.  ...  Bounded model checking is a verification technique based on searching for counter-examples to the validity of the specification using an encoding to propositional sastisfiability.  ...  Bounded model checking was first proposed in the context of linear-time temporal logic, where the structure of the counter-examples can be taken to be a run, a linear sequence of states, with the final  ... 
doi:10.1007/978-3-642-20674-0_7 fatcat:nmzniymf5nhljdvzewojgka4dq

Linear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility [article]

Vladimir Rybakov
2014 arXiv   pre-print
We discuss several ways to formalize conceptions of knowledge and agent's knowledge within given approach in non-transitive linear logic with models directed to past.  ...  We find algorithms solving mentioned problems, justify our approach to consider linear non-transitive time with several examples.  ...  Now we will modify the models for the ones with non-transitive time. Possible words models with non-transitive time Our approach will need a dual of LT L -the logic with since operation.  ... 
arXiv:1406.2783v1 fatcat:6cfec3emmbao3kvmnvlrrc7gga

Page 6295 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
In Section 6 we introduce a fragment of infinitary (linear time) temporal logic as a general specification language for level 2, with formal semantics based on reasoning frames (interpreted as linear time  ...  We propose two logics which take into account ‘deliberation time’ but use a more or less standard possible worlds semantics with classical possible worlds.”  ... 

Statistical Model Checking: An Overview [chapter]

Axel Legay, Benoît Delahaye, Saddek Bensalem
2010 Lecture Notes in Computer Science  
The model checking problem for stochastic systems with respect to such logics is typically solved by a numerical approach [31, 8, 35, 22, 21, 5 ] that iteratively computes (or approximates) the exact measure  ...  Another approach to solve the model checking problem is to simulate the system for finitely many executions, and use hypothesis testing to infer whether the samples provide a statistical evidence for the  ...  Acknowledgments We would like to thanks our collaborators on the statistical model checking project: Sumit Jha, and Marius Bozga.  ... 
doi:10.1007/978-3-642-16612-9_11 fatcat:khfqnua7gfbstj7zq7d7vxlnsi

Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics [article]

Alessio Lomuscio, Wojciech Penczek
2007 arXiv   pre-print
This article surveys some of the recent work in verification of temporal epistemic logic via symbolic model checking, focusing on OBDD-based and SAT-based approaches for epistemic logics built on discrete  ...  and real-time branching time temporal logics.  ...  SAT-based symbolic model checking SAT-based model checking is the most recent symbolic approach for modal logic.  ... 
arXiv:0709.0446v1 fatcat:uu2hztr4szhebmsqpj4bijluym
« Previous Showing results 1 — 15 out of 87,443 results