Sciweavers

4340 search results - page 271 / 868
» Formal Methods and Cryptography
Sort
View
ICFCA
2010
Springer
16 years 1 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
Felix Distel
FM
2009
Springer
106views Formal Methods» more  FM 2009»
16 years 1 months ago
Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
Rik Eshuis
HICSS
2007
IEEE
97views Biometrics» more  HICSS 2007»
16 years 29 days ago
Implementation-Oriented Secure Architectures
We propose a framework for constructing secure systems at the architectural level. This framework is composed of an implementation-oriented formalization of a system’s architect...
Daniel Conte de Leon, Jim Alves-Foss, Paul W. Oman
AGTIVE
2007
Springer
16 years 24 days ago
Programmed Graph Rewriting with DEVS
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
Eugene Syriani, Hans Vangheluwe
MDAI
2007
Springer
16 years 23 days ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...