On Simulation-Checking with Sequetial Systems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F00%3A00002734" target="_blank" >RIV/00216224:14330/00:00002734 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

On Simulation-Checking with Sequetial Systems

Original language 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).

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2000

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of 6th Asian Computing Science Conference (ASIAN 2000)

ISBN

3-540-41428-2

ISSN

—

e-ISSN

—

Number of pages

16

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin, Heidelberg, New York

Event location

—

Event date

—

Type of event by nationality

—

UT code for WoS article

—