5084 search results - page 224 / 1017 » Proving Possibility Properties |
159
click to vote
DEDS
2006
15 years 6 months ago
2006
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
155
click to vote
JUCS
2006
15 years 6 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
142
click to vote
IJAR
2007
15 years 6 months ago
2007
In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L usi...
158
click to vote
ENTCS
2002
15 years 6 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
155
click to vote
IANDC
1998
15 years 6 months ago
1998
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...