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

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

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

(14)

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

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)