25 search results - page 5 / 5 » Unbounded, Fully Symbolic Model Checking of Timed Automata u... |
FOSSACS
2011
Springer
12 years 8 months ago
2011
Springer
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...
FASE
2006
Springer
13 years 9 months ago
2006
Springer
This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications. The CASH...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
EMSOFT
2006
Springer
13 years 9 months ago
2006
Springer
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...