Sciweavers

2465 search results - page 51 / 493
» Automata on Linear Orderings
Sort
View
ENTCS
2006
185views more  ENTCS 2006»
13 years 7 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...
CORR
2009
Springer
115views Education» more  CORR 2009»
13 years 5 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
JLP
2010
105views more  JLP 2010»
13 years 2 months ago
Quantitative analysis of weighted transition systems
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...
Claus R. Thrane, Uli Fahrenberg, Kim G. Larsen
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
14 years 1 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
WIA
2001
Springer
14 years 6 days ago
Cascade Decompositions are Bit-Vector Algorithms
A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. In this paper, we describe the link...
Anne Bergeron, Sylvie Hamel