Model checking memoryful linear-time logics over one-counter automata (Q974117)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5712827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Model checking memoryful linear-time logics over one-counter automata |
scientific article; zbMATH DE number 5712827 |
Statements
Model checking memoryful linear-time logics over one-counter automata (English)
0 references
27 May 2010
0 references
one-counter automaton
0 references
temporal logic
0 references
first-order logic
0 references
computational complexity
0 references
0.9315932393074036
0 references
0.8520128726959229
0 references
0.8497301340103149
0 references
0.8290007710456848
0 references
0.822912335395813
0 references
