… We observe that, just like one-counter nets, ω-nets are monotone in the sense of Lemma 8
(… weak simulation for one-counter nets to strong simulation between a one-counter net and yet …

… problem of deciding simulation for a class of infinite-state systems which we call one-counter
nets… In Sections 3 we describe the simulation relation as a game between two players A and …

… maximal simulation relation for a given one-counter net. Then we demonstrate how to …
simulation problems over one-counter nets to analogous bisimulation problems over one-counter …

… the weak simulation problem on onecounter nets to a strong simulation problem on a … We
prove the decidability of simulation between onecounter nets and ω-nets. First, we show that for …

… To answer several of these questions, we use results and techniques from the simulation
problem over one-counter nets [23, 24]. This is not surprising, since simulation of various …

… problem; in contrast, we show that this problem is decidable for sweeping 2-OCN. They also
note that, over … In this phase we repeat the simulation phase above, ignoring the counter of A…

… of simulation for OCA. However, simulation is decidable for the subclass of one-counter nets,
… Ultimately, what makes the problem decidable for OCN is the monotonicity of steps, derived …

… Positive cheats can be verified by directly simulating the respective counter of M using the
… For verifying a negative cheat, we simulate the counting of M by an “opposite-counting” in A (…

… for the classical decision problems. The deterministic fragment … problems, and while these
problems and the expressive power of DOCNs have been studied, the determinization problem…

… Regarding the simulation problem, we give an example of a succinct one-counter net in
Figure 2; it is also a finite automaton equipped with a nonnegative counter. Now there is no Eve …