• PDF / 939,474 Bytes
• 30 Pages / 439.642 x 666.49 pts Page_size
• 39 Downloads / 242 Views

DOWNLOAD

REPORT

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata Antoine Mottet1

· Karin Quaas2

© Springer Science+Business Media, LLC, part of Springer Nature 2020

Abstract We investigate the complexity of the containment problem “Does L(A) ⊆ L(B ) hold?” for register automata and timed automata, where B is assumed to be unambiguous and A is arbitrary. We prove that the problem is decidable in the case of register automata over (N, =), in the case of register automata over (Q,

Recommend Documents

Synthesizing Clock-Efficient Timed Automata

173 88 19MB

Minimal Witnesses for Probabilistic Timed Automata

174 39 19MB

Grey-Box Learning of Register Automata

202 86 19MB

Urgent Partial Order Reduction for Extended Timed Automata

177 106 19MB

Guarded Autonomous Transitions Increase Conciseness and Expressiveness of Timed Automata

184 2 15MB

Backward Symbolic Optimal Reachability in Weighted Timed Automata

202 8 15MB

PAC Learning of Deterministic One-Clock Timed Automata

215 90 12MB

Computing Maximally-Permissive Strategies in Acyclic Timed Automata

172 65 15MB

The Automata

153 101 10MB

Active Learning of Timed Automata with Unobservable Resets

188 108 15MB

On Stateless Multihead Automata: Hierarchies and the Emptiness Problem

140 30 14MB

Cellular Automata and Groups

200 96 5MB