Sciweavers

303 search results - page 47 / 61
» Automata on Gauss Words
Sort
View
INFORMATICALT
2007
76views more  INFORMATICALT 2007»
13 years 9 months ago
An Integrative Framework to Protocol Analysis and Repair: Bellare-Rogaway Model + Planning + Model Checker
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
Kim-Kwang Raymond Choo
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 1 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
LATA
2009
Springer
14 years 4 months ago
Bounded Hairpin Completion
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
Masami Ito, Peter Leupold, Victor Mitrana
CISC
2006
Springer
106views Cryptology» more  CISC 2006»
14 years 1 months ago
A General Construction of Tweakable Block Ciphers and Different Modes of Operations
This work builds on earlier work by Rogaway at Asiacrypt 2004 on tweakable block cipher (TBC) and modes of operations. Our first contribution is to generalize Rogaway's TBC co...
Debrup Chakraborty, Palash Sarkar
CONCUR
2006
Springer
14 years 1 months ago
Controller Synthesis for MTL Specifications
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier