scientific article; zbMATH DE number 1754626

MaRDI QIDQ4535053zbMATH OpenFDO

Authors Luc Boasson, Ahmed Bouajjani, Parosh A. Abdulla

Publication date 12 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2076/20760639

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Grammars and rewriting systems (68Q42)

Recommendations

• Reachability problems on reliable and lossy queue automata
• Using forward reachability analysis for verification of lossy channel systems
• Verifying lossy channel systems has nonprimitive recursive complexity.
• On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
• scientific article; zbMATH DE number 1929967

Cited in

(8)

• Reachability problems on partially lossy queue automata
• \(\pi\)-calculus with noisy channels
• Monotonic extensions of Petri nets: forward and backward search revisited
• An approach to computing downward closures
• Value-passing CCS with noisy channels
• Cost Automata, Safe Schemes, and Downward Closures
• Cost automata, safe schemes, and downward closures
• Priority downward closures

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