scientific article; zbMATH DE number 1500528

zbMath0953.03050MaRDI QIDQ4501546

Grégoire Sutre, Alain Finkel

Publication date: 29 January 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (10)

Eliminating the storage tape in reachability constructions. ⋮ On store languages and applications ⋮ Verification in loosely synchronous queue-connected discrete timed automata. ⋮ Well-abstracted transition systems: Application to FIFO automata. ⋮ Recent advances on reachability problems for valence systems (invited talk) ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ On the \(\omega\)-language expressive power of extended Petri nets ⋮ Unnamed Item ⋮ LTL over integer periodicity constraints ⋮ Counter machines and verification problems.

This page was built for publication: