scientific article; zbMATH DE number 1759611

MaRDI QIDQ4536602zbMATH OpenFDO

Authors Oscar H. Ibarra, Tevfik Bultan, Jianwen Su

Publication date 28 November 2002

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On reachability and safety in infinite-state systems
• Counter machines and verification problems.
• scientific article; zbMATH DE number 1759429
• scientific article; zbMATH DE number 1773081
• scientific article; zbMATH DE number 3974295

Cited in

(14)

• Eliminating the storage tape in reachability constructions.
• On reachability and safety in infinite-state systems
• Automatic verification of recursive procedures with one integer parameter.
• The complexity of reversal-bounded model-checking
• Fixed point characterization of infinite behavior of finite-state systems
• Some decision problems concerning semilinearity and commutation.
• Augmenting the discrete timed automaton with other data structures.
• Grammatical characterizations of NPDAs and VPDAs with counters
• scientific article; zbMATH DE number 1759429 (Why is no real title available?)
• On store languages and applications
• Semilinearity of families of languages
• VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
• scientific article; zbMATH DE number 1773081 (Why is no real title available?)
• State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs

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 Q4536602)