Data Structures. As observed by ▇▇▇▇▇ et al. [34], register automata with input and output events can be used to represent semantic interfaces of simple data structures such as stacks, queues, and FIFO-sets with fixed capacities. Since they are parametrized by their capacity, these data structures provide excellent benchmarks for model learning tools, see e.g., [3].
Appears in 2 contracts
Sources: End User Agreement, End User Agreement