| dc.contributor.author | Jančar, Petr | |
| dc.contributor.author | Kučera, Antonín | |
| dc.contributor.author | Moller, Faron | |
| dc.date.accessioned | 2006-11-10T06:27:48Z | |
| dc.date.available | 2006-11-10T06:27:48Z | |
| dc.date.issued | 2000 | |
| dc.identifier.citation | STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000. Proceedings. 2000, p. 334-335. | en |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/10084/58036 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000. Proceedings | en |
| dc.relation.uri | https://link.springer.com/chapter/10.1007/3-540-46541-3_28 | en |
| dc.title | Simulation and bisimulation over one-counter processes | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.description.abstract-en | We show an effective construction of (a periodicity description of) the maximal simulation relation for a given one-counter net. then we demonstrate how to reduce simulation problems over one-counter nets to analogous bisimulation problems over one-counter automata. we use this to demonstrate the decidability of various problems, specifically testing regularity and strong regularity of one-counter nets with respect to simulation equivalence, and testing simulation equivalence between a one-counter net and a deterministic pushdown automaton. various obvious generalisations of these problems are known to be undecidable. | en |
| dc.identifier.wos | 000166852700028 | |