Sciweavers

852 search results - page 90 / 171
» entcs 2010
Sort
View
ENTCS
2006
112views more  ENTCS 2006»
14 years 11 months ago
Interface Automata with Complex Actions
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
Shahram Esmaeilsabzali, Farhad Mavaddat, Nancy A. ...
ENTCS
2006
199views more  ENTCS 2006»
14 years 11 months ago
Compositional Operational Semantics of a UML-Kernel-Model Language
We define a compositional operational semantics for state machines and their composition in UML. Each state machine describes the behavior of an object of a class. If a class of a...
Harald Fecher, Marcel Kyas, Willem P. de Roever, F...
ENTCS
2006
121views more  ENTCS 2006»
14 years 11 months ago
A Logic for Graphs with QoS
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
GianLuigi Ferrari, Alberto Lluch-Lafuente
ENTCS
2006
185views more  ENTCS 2006»
14 years 11 months ago
Time Domain Verification of Oscillator Circuit Properties
The application of formal methods to analog and mixed signal circuits requires efficient methods tructing abstractions of circuit behaviors. This paper concerns the verification o...
Goran Frehse, Bruce H. Krogh, Rob A. Rutenbar, Ode...
ENTCS
2006
123views more  ENTCS 2006»
14 years 11 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond