Forward analysis for WSTS, part I: completions
DOI10.1017/S0960129520000195zbMath1491.68122OpenAlexW3093599425MaRDI QIDQ3386750
Jean Goubault-Larrecq, Alain Finkel
Publication date: 7 January 2021
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129520000195
well-structured transition systemswell-quasi-orderingsNoetherian topological spacesideal completionsdownwards-closed subsetsfinite computable representations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of general topology to computer science (e.g., digital topology, image processing) (54H30)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding safety properties in infinite-state pi-calculus via behavioural types
- Termination orderings for associative-commutative rewriting systems
- On the sobrification remainder sX-X
- Recursivite et cônes rationnels fermés par intersection
- Reduction and covering of infinite reachability trees
- A structure to decide reachability in Petri nets
- Sobrification of partially ordered sets
- Topology, domain theory and theoretical computer science
- Undecidable problems in unreliable computations.
- Algorithmic analysis of programs with well quasi-ordered domains.
- Using forward reachability analysis for verification of lossy channel systems
- Verifying programs with unreliable channels
- Parallel program schemata
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- On families of mutually exclusive sets
- FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems
- An algorithm for the computation of the radical of an ideal
- Forward Analysis for WSTS, Part II: Complete WSTS
- Two-variable logic on data trees and XML reasoning
- Forward Analysis of Depth-Bounded Processes
- Noetherian Spaces in Verification
- Une extension d'un théorème de P. Jullien sur les âges de mots
- Deciding Piecewise Testable Separability for Regular Tree Languages
- Demystifying Reachability in Vector Addition Systems
- Continuous Lattices and Domains
- Non-Hausdorff Topology and Domain Theory
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- On Context-Free Languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Ordering by Divisibility in Abstract Algebras
- Verification, Model Checking, and Abstract Interpretation
- Well-structured transition systems everywhere!
This page was built for publication: Forward analysis for WSTS, part I: completions
