Journal article
Model Checking Succinct and Parametric One-Counter Automata.
- Abstract:
- We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which additive updates are encoded in binary, as well as parametric one-counter automata, in which additive updates may be given as unspecified parameters. We fully determine the complexity of model checking these automata against CTL, LTL, and modal μ-calculus specifications. © 2010 Springer-Verlag Berlin Heidelberg.
Actions
Authors
Contributors
+ Abramsky, S
Role:
Editor
+ Gavoille, C
Role:
Editor
+ Kirchner, C
Role:
Editor
+ Heide, F
Role:
Editor
+ Spirakis, P
Role:
Editor
Bibliographic Details
- Publisher:
- Springer Publisher's website
- Journal:
- ICALP (2)
- Volume:
- 6199
- Issue:
- PART 2
- Pages:
- 575-586
- Publication date:
- 2010-01-01
- DOI:
- EISSN:
-
1611-3349
- ISSN:
-
0302-9743
Item Description
- Language:
- English
- Pubs id:
-
pubs:300106
- UUID:
-
uuid:0cf27bce-e14f-47c5-9b02-d367c1a1893a
- Local pid:
- pubs:300106
- Source identifiers:
-
300106
- Deposit date:
- 2012-12-20
Terms of use
- Copyright date:
- 2010
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record