2465 search results - page 128 / 493 » Automata on Linear Orderings |
113
click to vote
GG
2004
Springer
15 years 6 months ago
2004
Springer
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...
103
Voted
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
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...
123
Voted
CAV
2003
Springer
15 years 4 months ago
2003
Springer
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...
103
Voted
FUIN
2006
15 years 1 months ago
2006
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 ...
89
Voted
TSMC
2002
15 years 20 days ago
2002
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...