Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations

DOI10.1007/3-540-63165-8_211zbMath1401.68186MaRDI QIDQ4571986

Ahmed Bouajjani, Peter Habermehl

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_211

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Regular Model Checking using Widening Techniques, Regular model checking: evolution and perspectives, Well-abstracted transition systems: Application to FIFO automata., Flat Petri nets (invited talk), Algorithmic analysis of polygonal hybrid systems. I: Reachability, Exact Acceleration of Real-Time Model Checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Unreliable channels are easier to verify than perfect channels
• Verifying programs with unreliable channels
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• On Communicating Finite-State Machines
• On Context-Free Languages
• Reachability analysis of pushdown automata: Application to model-checking