scientific article; zbMATH DE number 7471708
From MaRDI portal
Publication:5028474
Amrita Suresh, Benedikt Bollig, Alain Finkel
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2105.06723
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Uses Software
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
- Fifo nets without order deadlock
- Using forward reachability analysis for verification of lossy channel systems
- A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets
- 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
- Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete
- ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS
- The tree width of auxiliary storage
- Context-Bounded Analysis of Concurrent Queue Systems
- Bounded Algol-Like Languages
- Reachability Analysis of Communicating Pushdown Systems
- Well-structured transition systems everywhere!
This page was built for publication:
