Sciweavers

114 search results - page 15 / 23
» A Determinizable Class of Timed Automata
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Minimum-Time Reachability in Timed Games
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 2 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha
ITP
2010
179views Mathematics» more  ITP 2010»
13 years 11 months ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler
FORMATS
2004
Springer
14 years 1 months ago
Learning of Event-Recording Automata
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
Olga Grinchtein, Bengt Jonsson, Martin Leucker
CSR
2010
Springer
14 years 13 days ago
Realizability of Dynamic MSC Languages
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
Benedikt Bollig, Loïc Hélouët