Sciweavers

2465 search results - page 128 / 493
» Automata on Linear Orderings
Sort
View
GG
2004
Springer
14 years 2 months ago
Composition of Path Transductions
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
Tanguy Urvoy
FSTTCS
2001
Springer
14 years 1 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
CAV
2003
Springer
140views Hardware» more  CAV 2003»
14 years 26 days ago
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...
Dirk Beyer, Claus Lewerentz, Andreas Noack
FUIN
2006
142views more  FUIN 2006»
13 years 9 months ago
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
Magdalena Kacprzak, Alessio Lomuscio, Artur Niewia...
TSMC
2002
105views more  TSMC 2002»
13 years 8 months ago
V-Lab-a virtual laboratory for autonomous agents-SLA-based learning controllers
In this paper, we present the use of stochastic learning automata (SLA) in mutliagent robotics. In order to fully utilize and implement learning control algorithms in the control o...
Aly I. El-Osery, John Burge, Mohammad Jamshidi, An...