Sciweavers

2043 search results - page 312 / 409
» Reasoning About Security Models
Sort
View
WADT
1998
Springer
15 years 4 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 ...
ER
2008
Springer
99views Database» more  ER 2008»
15 years 2 months ago
Relaxed Compliance Notions in Adaptive Process Management Systems
The capability to dynamically evolve process models over time and to migrate process instances to a modified model version are fundamental requirements for any process-aware inform...
Stefanie Rinderle-Ma, Manfred Reichert, Barbara We...
119
Voted
WSC
2004
15 years 2 months ago
Exploring Agent-Supported Simulation Brokering on the Semantic Web: Foundations for a Dynamic Composability Approach
Federated simulations address the need for interoperability, as well as the improvement of reuse and composability of existing simulation models. The focal goal in a federated sim...
Levent Yilmaz, Tuncer I. Ören
118
Voted
ENTCS
2008
140views more  ENTCS 2008»
15 years 22 days ago
Linking Event-B and Concurrent Object-Oriented Programs
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...
Andrew Edmunds, Michael Butler
86
Voted
IPL
2008
89views more  IPL 2008»
15 years 20 days ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik