Sciweavers

108 search results - page 14 / 22
» Finite Model Reasoning in DL-Lite
Sort
View
EMSOFT
2006
Springer
14 years 1 months ago
Analysis of the zeroconf protocol using UPPAAL
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
Biniam Gebremichael, Frits W. Vaandrager, Miaomiao...
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 10 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
LICS
1994
IEEE
14 years 1 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
FORMATS
2008
Springer
13 years 11 months ago
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
Jirí Srba
GIS
2004
ACM
14 years 10 months ago
Time-dependent affine triangulation of spatio-temporal data
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
Sofie Haesevoets, Bart Kuijpers