On Simulation-Checking with Sequential Systems
| Authors | |
|---|---|
| Year of publication | 2000 |
| Type | Article in Proceedings |
| Conference | Proceedings of 6th Asian Computing Science Conference (ASIAN 2000) |
| MU Faculty or unit | |
| Citation | |
| Field | Computer hardware and software |
| Keywords | concurrency; simulation; temporal logics; one-counter automata |
| Description | We present new complexity results for simulation-checking and model-checking with infinite-state systems generated by pushdown automata and their proper subclasses of one-counter automata and one-counter nets (one-counter nets are "weak" one-counter automata computationally equivalent to Petri nets with at most one unbounded place). |
| Related projects: |