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

DOI10.4230/LIPIcs.CONCUR.2020.49OpenAlexW4287919515MaRDI QIDQ5089316

Benedikt Bollig, Amrita Suresh, Alain Finkel

Publication date: 18 July 2022

Full work available at URL: https://hal.archives-ouvertes.fr/hal-02870687

zbMATH Keywords

reachabilitycounter machinesunderapproximationFIFO machines

Mathematics Subject Classification ID

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

Related Items

On the preservation of properties when changing communication models ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for unboundedness of fifo channels
• Unboundedness detection for a class of communicating finite-state machines
• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Automates a file
• Using forward reachability analysis for verification of lossy channel systems
• On the \(k\)-synchronizability of systems
• Verification of programs with half-duplex communication
• Model-checking CTL* over flat Presburger counter systems
• A Perfect Model for Bounded Verification
• Forward Analysis and Model Checking for Trace Bounded WSTS
• Verifying Communicating Multi-pushdown Systems via Split-Width
• On Communicating Finite-State Machines
• An Algorithm for the General Petri Net Reachability Problem
• The reachability problem for Petri nets is not elementary
• The tree width of auxiliary storage
• Context-Bounded Analysis of Concurrent Queue Systems
• Bounded Algol-Like Languages
• Verification of Flat FIFO Systems
• Reachability Analysis of Communicating Pushdown Systems
• Well-structured transition systems everywhere!
• On the completeness of verifying message passing programs under bounded asynchrony