Sciweavers

396 search results - page 11 / 80
» Factor Automata of Automata and Applications
Sort
View
ASWEC
2007
IEEE
14 years 1 months ago
Timed Behavior Trees and Their Application to Verifying Real-Time Systems
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
Lars Grunske, Kirsten Winter, Robert Colvin
FOSSACS
2011
Springer
12 years 11 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
ECAI
2010
Springer
13 years 7 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
VMCAI
2009
Springer
14 years 2 months ago
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability r...
Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
FORTE
2004
13 years 9 months ago
Formal Verification of Web Applications Modeled by Communicating Automata
In this paper, we present an approach for modeling an existing web application using communicating finite automata model based on the userdefined properties to be validated. We ela...
May Haydar, Alexandre Petrenko, Houari A. Sahraoui