Filters








89 Hits in 5.3 sec

Chapter 12 Temporal Representation and Reasoning [chapter]

Michael Fisher
2008 Foundations of Artificial Intelligence  
Consequently, the notion of representations changing through time is vital. And so, we need a clear way of representing both our temporal basis, and the way in which entities change over time.  ...  We aim to provide the reader with an overview of many of the ways temporal phenomena can be modelled, described, reasoned about, and applied.  ...  Acknowledgements The author would like to thank a number of experts in the area who have reviewed this chapter and provided valuable insights and corrections, in particular: Anthony Galton  ... 
doi:10.1016/s1574-6526(07)03012-x fatcat:kuqoy7zvjzd5nhqkakvdn7vgs4

On the Verification of a WiMax Design Using Symbolic Simulation

Salim Ismail Al-Akhras, Sofiène Tahar, Gabriela Nicolescu, Michel Langevin, Pierre Paulin
2013 Electronic Proceedings in Theoretical Computer Science  
In this paper, we propose a methodology for the verification of conformance of models generated at higher levels of abstraction in the design process to the design specifications.  ...  In top-down multi-level design methodologies, design descriptions at higher levels of abstraction are incrementally refined to the final realizations.  ...  Due to its generality and mathematical basis, theorem proving can be applied to almost any verification problem in any domain.  ... 
doi:10.4204/eptcs.122.3 fatcat:5lu7oucvrra3tn3bgzuyoxvh3m

Modalities for model checking (extended abstract)

E. Allen Emerson, Chin-Laung Lei
1985 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85  
The syntax of PTL, is very similar to FCTL but an assertion such as A+Fp means intuitively that p will eventually hold with probability one.  ...  in a propositional temporal logic.  ... 
doi:10.1145/318593.318620 dblp:conf/popl/EmersonL85 fatcat:x6kty74qarhxfhzekz7ey5ypvi

The power of temporal proofs

Martín Abadi
1989 Theoretical Computer Science  
Unfortunately, all effective proof systems for temporal logic are incomplete for the standard semantics, in the sense that some formulas hold in every intended model but cannot be proved.  ...  We evaluate and compare the power of several proof systems for temporal logic. Specifically, we relate temporal systems to classical systems with explicit time parameters.  ...  Acknowledgment I am grateful to Gianluigi Bellin, Sol Feferman, Rob Goldblatt, Leo Harrington, John Lamping, Mark Manasse, and two anonymous  ... 
doi:10.1016/0304-3975(89)90138-2 fatcat:ommjnz4movci5bfwzyriqzoehm

E -connections of abstract description systems

Oliver Kutz, Carsten Lutz, Frank Wolter, Michael Zakharyaschev
2004 Artificial Intelligence  
Abstract description systems Abstract description systems (ADSs) have been proposed in [13] as a common generalization of description logics, modal logics, temporal logics, and some other formalisms.  ...  The new method, called E -connection, is defined in terms of abstract description systems (ADSs), a common generalization of description logics, many logics of time and space, as well as modal and epistemic  ...  Propositional temporal logic Finally, we consider the propositional temporal logic PTL [23, 29, 31] which is a wellknown tool for reasoning about time.  ... 
doi:10.1016/j.artint.2004.02.002 fatcat:syooatrh6nekxj5uetgfddx7p4

Applying Formal Methods to Networking: Theory, Techniques, and Applications

Junaid Qadir, Osman Hasan
2015 IEEE Communications Surveys and Tutorials  
of architecture and abstractions.  ...  The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built  ...  Linear temporal logic (LTL) is a subset of the more complex CTL that additionally allows branching time and quantifiers. LTL is also sometimes called propositional temporal logic, abbreviated PTL.  ... 
doi:10.1109/comst.2014.2345792 fatcat:oc6l6pn4tnddjbbr5v4gbbuycq

Formal verification of timed systems: a survey and perspective

Farn Wang
2004 Proceedings of the IEEE  
An overview of the current state of the art of formal verification of real-time systems is presented.  ...  We also make a few comments according to our experience with verification tool design and implementation.  ...  But backward analysis is almost mandatory for model checking because the modalities of strong "until" ( , , U, or EU) and strong "eventually" ( , , F, or EF) can only be efficiently handled with backward  ... 
doi:10.1109/jproc.2004.831197 fatcat:7e5u5rvdbncqbmkku7szkdyz34

Report on BCTCS 2012

Ian Pratt-Hartmann
2012 Bulletin of the European Association for Theoretical Computer Science  
am Main ("On the expressive power of logics with invariant uses of arithmetic predicates") and Daniel Kroening, of Oxford University ("SAT over an Abstract Domain").  ...  Abstracts for all of the talks are provided below.  ...  In this talk, we highlight the strong connection between the view update problem and the notion of definability in logic, and we revisit the abstract functional framework by Bancilhon and Spyratos in a  ... 
dblp:journals/eatcs/Pratt-Hartmann12 fatcat:cgww3bkyazb6ncfzowolyhdkk4

Probabilistic symbolic model checking with PRISM: a hybrid approach

Marta Kwiatkowska, Gethin Norman, David Parker
2004 International Journal on Software Tools for Technology Transfer (STTT)  
in the probabilistic temporal logics PCTL and CSL.  ...  In addition, thanks to the compact model representation using MTBDDs, we can verify systems an order of magnitude larger than with sparse matrices, whilst almost matching or even beating them for speed  ...  in the probabilistic temporal logics PCTL and CSL.  ... 
doi:10.1007/s10009-004-0140-2 fatcat:xqud3lfsgbhnbm4zaqe3cdkgqi

Proving properties of real-time systems through logical specifications and Petri net models

M. Felder, D. Mandrioli, A. Morzenti
1994 IEEE Transactions on Software Engineering  
A method is proposed that allows specifying system properties in the TRIO language (an extension of temporal logic suitable to deal explicitly with the "time" variable and to measure it) and modeling the  ...  temporal logic towards the same direction.  ...  In particular, ENEL and CISE cooperate to the development of the specification language TRIO, of its environment, and to its application to real-life projects.  ... 
doi:10.1109/32.265634 fatcat:jmj6jga7xrha5o733bwbrgsnbi

An AGM-style belief revision mechanism for probabilistic spatio-temporal logics

John Grant, Francesco Parisi, Austin Parker, V.S. Subrahmanian
2010 Artificial Intelligence  
In addition, there may be applications where the user has doubts about the accuracy of the spatial information, or the temporal aspects, or about the ability to recognize objects in such statements.  ...  Allowing changes to the probability of statements in the KB yields another belief revision mechanism.  ...  Acknowledgements Researchers funded in part by ARO grant W911NF0910206, ONR grant N000140910685, and AFOSR grant FA95500510298. We thank the referees for many helpful comments and suggestions.  ... 
doi:10.1016/j.artint.2009.10.002 fatcat:f24ly34m3zgrrclnq2zt4fbhii

Security and Privacy Functionalities in IoT

Elahe Fazeldehkordi, Olaf Owe, Josef Noll
2019 2019 17th International Conference on Privacy, Security and Trust (PST)  
One may take a bottom-up approach, starting with low level languages in use, or one i Abstract may take a top-down approach, starting with a more abstract language with an expressiveness suitable for IoT  ...  Formal methods have come into wide use in the design and verification of safety, security, and privacy of systems in the industry, because they are very effective in verifying safety, security, and privacy  ...  the EU H2020 research and innovation programme.  ... 
doi:10.1109/pst47121.2019.8949054 dblp:conf/pst/FazeldehkordiON19 fatcat:x37vqxe35vdtdlo2xebg7beaoa

Formal Verification of Multi-Paxos for Distributed Consensus [article]

Saksham Chand, Yanhong A. Liu, Scott D. Stoller
2019 arXiv   pre-print
This article describes formal specification and verification of Lamport's Multi-Paxos algorithm for distributed consensus. The specification is written in TLA+, Lamport's Temporal Logic of Actions.  ...  We also discuss our general strategies and results for proving complex invariants using invariance lemmas and increments, for proving properties about sets and tuples to help the proof check succeed in  ...  Any opinions, ndings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily re ect the views of these agencies.  ... 
arXiv:1606.01387v4 fatcat:hfnrybzgr5c4tm3oiim3tdjymi

Theoretical Engineering and Satellite Comlink of a PTVD-SHAM System [article]

Philip B. Alipour
2007 arXiv   pre-print
The 'Parallel Time Varying & Data Super-helical Access Memory' (PTVD-SHAM), possesses a waterfall effect in its architecture dealing with the process of voltage output-switch into diverse logic and quantum  ...  illustrated in the Subsections of the paper.  ...  Acknowledgements The work described in this paper was supported personally as an extension to the basis of a scientific book, research project license no: TXU001347562, USA (1998)(1999)(2000)(2001)(2002  ... 
arXiv:0710.0244v1 fatcat:m4mmseozxrbxpe6tas6pr4ncwi

Integrated logic synthesis using simulated annealing

Petra Färm, Elena Dubrova, Andreas Kuehlmann
2011 Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI - GLSVLSI '11  
Abstract A conventional logic synthesis flow is composed of three separate phases: technology independent optimization, technology mapping, and technology dependent optimization.  ...  We are hoping that our research in how to apply our developed logic synthesis framework to two of the emerging technologies might provide useful information for other designers moving in this direction  ...  The temporally homogeneous transition probabilities property. Given that at time t the process is in state s i , the probability that one time unit later it is in state s j is independent of t.  ... 
doi:10.1145/1973009.1973095 dblp:conf/glvlsi/FarmDK11 fatcat:dlju72re25ae7jgninv5kuntia
« Previous Showing results 1 — 15 out of 89 results