scientific article; zbMATH DE number 1500528

MaRDI QIDQ4501546zbMATH OpenFDO

Authors Grégoire Sutre, Alain Finkel

Publication date 29 January 2001

zbMATH Keywords

semilinearitysymbolic reachability tree algorithmtwo counter automata

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automated Technology for Verification and Analysis
• New Decidability Results Concerning Two-Way Counter Machines
• scientific article; zbMATH DE number 1759422
• Reachability in Succinct and Parametric One-Counter Automata

Cited in

(15)

• On the determinacy problem for two-way pushdown automata
• Verification in loosely synchronous queue-connected discrete timed automata.
• Well-abstracted transition systems: Application to FIFO automata.
• Counter machines and verification problems.
• Eliminating the storage tape in reachability constructions.
• On store languages and applications
• On the \(\omega\)-language expressive power of extended Petri nets
• LTL over integer periodicity constraints
• Recent advances on reachability problems for valence systems (invited talk)
• The Decidability of the Reachability Problem for CCS!
• scientific article; zbMATH DE number 1979491 (Why is no real title available?)
• scientific article; zbMATH DE number 1759422 (Why is no real title available?)
• Reachability for two-counter machines with one test and one reset
• Store languages of Turing machines and counter machines
• Verification of qualitative \(\mathbb Z\) constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501546)