Sciweavers

50 search results - page 8 / 10
» Temporal Logic with Predicate lambda-Abstraction
Sort
View
IAT
2006
IEEE
14 years 1 months ago
Specification and Verification of Dynamics in Cognitive Agent Models
Within many domains, among which biological and cognitive areas, multiple interacting processes occur among agents with dynamics that are hard to handle. Current approaches to ana...
Tibor Bosse, Catholijn M. Jonker, Lourens van der ...
FSTTCS
2004
Springer
14 years 25 days ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...
LREC
2008
125views Education» more  LREC 2008»
13 years 9 months ago
Towards Formal Interpretation of Semantic Annotation
In this paper we present a novel approach to the incremental incorporation of semantic information in natural language processing which does not fall victim to the notorious probl...
Harry Bunt, Chwhynny Overbeeke
QEST
2005
IEEE
14 years 1 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha