scientific article; zbMATH DE number 7269251
From MaRDI portal
Publication:5129947
Publication date: 3 November 2020
Full work available at URL: https://arxiv.org/abs/1908.07282
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Reachability problems on reliable and lossy queue automata ⋮ Branch-well-structured transition systems and extensions ⋮ On the preservation of properties when changing communication models ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Complexity Hierarchies beyond Elementary
- 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
- Structurally Cyclic Petri Nets
- Towards a Model-Checker for Counter Systems
- On Communicating Finite-State Machines
- On the complexity of integer programming
- 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
