Sciweavers

221 search results - page 4 / 45
» From MITL to Timed Automata
Sort
View
JACM
2002
142views more  JACM 2002»
13 years 7 months ago
Timed regular expressions
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
Eugene Asarin, Paul Caspi, Oded Maler
FUIN
2008
101views more  FUIN 2008»
13 years 7 months ago
Translation of Intermediate Language to Timed Automata with Discrete Data
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...
Agata Janowska, Pawel Janowski, Dobieslaw Wr&oacut...
EVOW
2010
Springer
14 years 14 days ago
Evolutionary Sound Synthesis: Rendering Spectrograms from Cellular Automata Histograms
In this paper we report on the synthesis of sounds using cellular automata, specifically the multitype voter model. The mapping process adopted is based on digital signal processin...
Jaime Serquera, Eduardo R. Miranda
APN
2005
Springer
13 years 9 months ago
Timed-Arc Petri Nets vs. Networks of Timed Automata
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
Jirí Srba
ICTAC
2009
Springer
14 years 1 months ago
Regular Expressions with Numerical Constraints and Automata with Counters
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
Dag Hovland