Sciweavers

203 search results - page 9 / 41
» Modal Expressiveness of Graph Properties
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
LFCS
2009
Springer
14 years 1 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
FUIN
2008
93views more  FUIN 2008»
13 years 7 months ago
Logic-based Conflict Detection for Distributed Policies
Policies are used to describe rules that are employed to modify (often distributed) system behaviour at runtime. Typically policies are created by many different people and there a...
Carlo Montangero, Stephan Reiff-Marganiec, Laura S...
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 7 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
ICALP
2005
Springer
14 years 28 days ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...