Branch-well-structured transition systems and extensions
From MaRDI portal
Publication:2165211
DOI10.1007/978-3-031-08679-3_4zbMath1499.68221arXiv2211.15913OpenAlexW4293197419MaRDI QIDQ2165211
Amrita Suresh, Alain Finkel, Benedikt Bollig
Publication date: 19 August 2022
Full work available at URL: https://arxiv.org/abs/2211.15913
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Testing for unboundedness of fifo channels
- Deciding branching time properties for asynchronous programs
- Reduction and covering of infinite reachability trees
- A well-structured framework for analysing Petri net extensions
- Algorithmic analysis of programs with well quasi-ordered domains.
- A partition calculus in set theory
- Handling Infinitely Branching WSTS
- Ordering by Divisibility in Abstract Algebras
- Well-structured transition systems everywhere!
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item