Sciweavers

3750 search results - page 76 / 750
» Timed Automata Patterns
Sort
View
ICALP
2000
Springer
15 years 5 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera
JLP
2010
105views more  JLP 2010»
14 years 9 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
ENTCS
2006
112views more  ENTCS 2006»
15 years 2 months ago
Patterns for Timed Property Specifications
Patterns for property specification enable non-experts to write formal specifications that can be used for automatic model checking. The existing patterns identified in [6] allow ...
Volker Gruhn, Ralf Laue
IWSOS
2011
Springer
14 years 5 months ago
Evolving Self-organizing Cellular Automata Based on Neural Network Genotypes
Abstract This paper depicts and evaluates an evolutionary design process for generating a complex self-organizing multicellular system based on Cellular Automata (CA). We extend th...
Wilfried Elmenreich, István Fehérv&a...
ICDM
2008
IEEE
129views Data Mining» more  ICDM 2008»
15 years 8 months ago
Sequence Mining Automata: A New Technique for Mining Frequent Sequences under Regular Expressions
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space,...
Roberto Trasarti, Francesco Bonchi, Bart Goethals