Sciweavers

4047 search results - page 352 / 810
» Algebraic Model Checking
Sort
View
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
15 years 11 months ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
FUIN
2007
84views more  FUIN 2007»
15 years 6 months ago
Observation Based System Security
A formal model for description of passive and active timing attacks is presented, studied and compared with other security concepts. It is based on a timed process algebra and on a...
Damas P. Gruska
ENTCS
2010
107views more  ENTCS 2010»
15 years 6 months ago
PobSAM: Policy-based Managing of Actors in Self-Adaptive Systems
In this paper, we present a formal model, named PobSAM (Policy-based Self-Adaptive Model), for modeling self-adaptive systems. In this model, policies are used as a mechanism to d...
Narges Khakpour, Saeed Jalili, Carolyn L. Talcott,...
CONCURRENCY
2006
112views more  CONCURRENCY 2006»
15 years 6 months ago
Implementing BPEL4WS: the architecture of a BPEL4WS implementation
e a set of very distinctive abstractions that result in significant modifications of the basic workflow model as outlined in pre-existing workflow model, see [2] for example. In pa...
Francisco Curbera, Rania Khalaf, William Nagy, San...
148
Voted
CHARME
2005
Springer
120views Hardware» more  CHARME 2005»
16 years 9 days ago
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
Arie Gurfinkel, Marsha Chechik