scientific article; zbMATH DE number 7471708
From MaRDI portal
Publication:5028474
Authors: Benedikt Bollig, Amrita Suresh, Alain Finkel 
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2105.06723
Title of this publication is not available (Why is that?)
Recommendations
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
- Reachability problems in piecewise FIFO systems
- scientific article; zbMATH DE number 4115984
- Decidability results for the boundedness problem
- Boundedness problems for Minsky counter machines
- Boundedness problems for Minsky counter machines
- Some decidable results on reachability of solvable systems
- Decidability of the Petri net reachability problem
- Decidability of the reachability problem for pushdown relational automata
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
Cites Work
- Title not available (Why is that?)
- Bounded Algol-Like Languages
- Verification of programs with half-duplex communication
- On Communicating Finite-State Machines
- Using forward reachability analysis for verification of lossy channel systems
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- Well-structured transition systems everywhere!
- Automates a file
- Adjacent ordered multi-pushdown systems
- Context-Bounded Analysis of Concurrent Queue Systems
- Reachability analysis of communicating pushdown systems
- An Algorithm for the General Petri Net Reachability Problem
- The tree width of auxiliary storage
- A perfect model for bounded verification
- Title not available (Why is that?)
- Testing for unboundedness of fifo channels
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unboundedness detection for a class of communicating finite-state machines
- An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
- Verifying communicating multi-pushdown systems via split-width
- Title not available (Why is that?)
- Fifo nets without order deadlock
- A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets
- On the \(k\)-synchronizability of systems
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- Forward analysis and model checking for trace bounded WSTS
Cited In (2)
Uses Software
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 Q5028474)
