Sciweavers

1788 search results - page 62 / 358
» Model Theory for Process Algebra
Sort
View
114
Voted
INLG
2010
Springer
14 years 10 months ago
Generating Referring Expressions with Reference Domain Theory
In this paper we present a reference generation model based on Reference Domain Theory which gives a dynamic account of reference. This reference model assumes that each referring...
Alexandre Denis
111
Voted
LFCS
2007
Springer
15 years 6 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
88
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp
IWFM
2000
167views Formal Methods» more  IWFM 2000»
15 years 2 months ago
An Algebraic Basis for Specifying and Enforcing Access Control in Security Systems
Security services in a multi-user environment are often based on access control mechanisms. Static of an access control policy can be formalised using abstract algebraic models. W...
Claus Pahl
CMSB
2009
Springer
15 years 7 months ago
Equivalence and Discretisation in Bio-PEPA
Bio-PEPA is a process algebra for modelling biological systems. An important aspect of Bio-PEPA is the ability it provides to discretise concentrations resulting in a smaller, more...
Vashti Galpin, Jane Hillston