Analyzing fair parametric extended automata

DOI10.1007/3-540-47764-0_19MaRDI QIDQ4779118zbMATH OpenFDO

Authors Ahmed Bouajjani, Aurore Collomb-Annichini, Mihaela Sighireanu, Yassine Lakhnech

Publication date 25 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-47764-0_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Fairness for Infinite-State Systems
• Liveness with \({(0,1,\infty)}\)-counter abstraction
• Liveness and acceleration in parameterized verification
• Parameterized verification by probabilistic abstraction
• Symbolic techniques for parametric reasoning about counter and clock systems

Cited in

(1)

• Proving the existence of fair paths in infinite-state systems

This page was built for publication: Analyzing fair parametric extended automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779118)