Sciweavers

38 search results - page 2 / 8
» Ordinal Theory for Expressiveness of Well Structured Transit...
Sort
View
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 4 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
HYBRID
2010
Springer
13 years 2 months ago
Timed I/O automata: a complete specification theory for real-time systems
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
Alexandre David, Kim G. Larsen, Axel Legay, Ulrik ...
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
13 years 9 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
WADT
1998
Springer
13 years 8 months ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...
CCS
2007
ACM
13 years 11 months ago
Managing RBAC states with transitive relations
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
Chaoyi Pang, David P. Hansen, Anthony J. Maeder