40

views

    

0

recommends

0

shares

Record: found
Abstract: not found
Book Chapter: not found

Branching-Time Model Checking of Parametric One-Counter Automata

other

Author(s): Stefan Göller , Christoph Haase , Joël Ouaknine , James Worrell

Publication date (Print): 2012

Publisher: Springer Berlin Heidelberg

Read this book at

There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 17

Record: found
Abstract: not found
Article: not found

Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines

Marvin Minsky (1961)

0 comments Cited 64 times – based on 0 reviews      Review now

Record: found
Abstract: found
Article: not found

Definability and decision problems in arithmetic

Julia Robinson (1949)

In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems.

0 comments Cited 33 times – based on 0 reviews      Review now

Record: found
Abstract: not found
Book Chapter: not found

Multiple counters automata, safety analysis and presburger arithmetic

Hubert Comon, Yan Jurski (1998)

0 comments Cited 30 times – based on 0 reviews

Author and book information

Book Chapter

Publication date (Print): 2012

Pages: 406-420

DOI: 10.1007/978-3-642-28729-9_27

SO-VID: a433b973-4444-47ca-9ba6-5ffd58beced1

History

Data availability:

Comments

Comment on this book

Book chapters

Similar content 3,577

See all similar

Cited by 4

See all cited by