Verification of Flat FIFO Systems

DOI10.4230/LIPIcs.CONCUR.2019.12OpenAlexW2970619640MaRDI QIDQ5875373

M. Praveen, Alain Finkel

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2019.12

zbMATH Keywords

complexityreachabilityterminationFIFOcountersinfinite state systemsflat systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Non axiomatisability of positive relation algebras with constants, via graph homomorphisms

Uses Software

• FLATA
• Easychair
• FAST

Cites Work

• Testing for unboundedness of fifo channels
• Well-abstracted transition systems: Application to FIFO automata.
• Using forward reachability analysis for verification of lossy channel systems
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• How hard is it to verify flat affine counter systems with the finite monoid property?
• Taming past LTL and flat counter systems
• Verification of programs with half-duplex communication
• Model-checking CTL* over flat Presburger counter systems
• Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops
• A Perfect Model for Bounded Verification
• Forward Analysis for WSTS, Part II: Complete WSTS
• Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic
• Structurally Cyclic Petri Nets
• Towards a Model-Checker for Counter Systems
• On Communicating Finite-State Machines
• Model-Checking Counting Temporal Logics on Flat Structures
• On the Complexity of Verifying Regular Properties on Flat Counter Systems,
• Automated Technology for Verification and Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verification of Flat FIFO Systems