scientific article; zbMATH DE number 7278088
From MaRDI portal
Publication:5136306
DOI10.4230/LIPIcs.FSTTCS.2017.16zbMath1491.68118MaRDI QIDQ5136306
Michael Blondin, Jean Goubault-Larrecq, Alain Finkel
Publication date: 25 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Unnamed Item ⋮ Parameterized verification of coverability in infinite state broadcast networks ⋮ Forward analysis for WSTS, part I: completions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forward analysis and model checking for trace bounded WSTS
- Undecidable verification problems for programs with unreliable channels
- Multiset rewriting for the verification of depth-bounded processes with name binding
- The residue of vector sets with applications to decidability problems in Petri nets
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
- Theory of relations. Transl. from the French by P. Clote
- Ordered sets with no infinite antichains
- Reduction and covering of infinite reachability trees
- Rélations non reconstructibles par leurs restrictions
- A well-structured framework for analysing Petri net extensions
- Algorithmic analysis of programs with well quasi-ordered domains.
- Computable fixpoints in well-structured symbolic model checking
- Recursive Petri nets
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- On families of mutually exclusive sets
- ω-Petri Nets: Algorithms and Complexity
- Coverability Trees for Petri Nets with Unordered Data
- Ideal Abstractions for Well-Structured Transition Systems
- Forward Analysis and Model Checking for Trace Bounded WSTS
- Bounds on Mobility
- Lossy Counter Machines Decidability Cheat Sheet
- Forward Analysis for WSTS, Part II: Complete WSTS
- Handling Infinitely Branching WSTS
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
- On Context-Free Languages
- Well-structured transition systems everywhere!
