16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008) (2011)
Ayia Napa, Cyprus
Feb. 9, 2011 to Feb. 11, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDP.2011.57
Uniform parameterisations of cooperations are defined in terms of formal language theory, such that each pair of partners cooperates in the same manner, and that the mechanism (schedule) to determine how one partner may be involved in several cooperations, is the same for each partner. Generalising each pair of partners cooperating in the same manner, for such systems of cooperations a kind of self-similarity is formalised. From an abstracting point of view, where only actions of some selected partners are considered, the complex system of all partners behaves like the smaller subsystem of the selected partners. For verification purposes, so called uniformly parameterised safety properties are defined. Such properties can be used to express privacy policies as well as security and dependability requirements. It is shown, how the parameterised problem of verifying such a property is reduced by self-similarity to a finite state problem.
security of data, formal languages, formal language theory, security properties, self similar uniformly parameterised systems, Automata, Schedules, Privacy, Safety, Servers, Formal languages, Indexes, uniformly parameterised safety properties, cooperations as prefix closed languages, abstractions of system behaviour, self-similarity in systems of cooperations, privacy policies
"Security Properties of Self-Similar Uniformly Parameterised Systems of Cooperations", 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008), vol. 00, no. , pp. 640-645, 2011, doi:10.1109/PDP.2011.57