scientific article; zbMATH DE number 1500528

zbMATH Open0953.03050MaRDI QIDQ4501546FDOQ4501546

Grégoire Sutre, Alain Finkel

Publication date: 29 January 2001

Title of this publication is not available (Why is that?)

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)

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.
• Title not available (Why is that?)
• 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)
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Automated Technology for Verification and Analysis 👍 👎
• New Decidability Results Concerning Two-Way Counter Machines 👍 👎
• Title not available (Why is that?) 👍 👎
• Reachability in Succinct and Parametric One-Counter Automata 👍 👎

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)