scientific article; zbMATH DE number 6027236

DOI10.4230/LIPICS.STACS.2009.1844zbMath1236.68183MaRDI QIDQ5389997

Jean Goubault-Larrecq, Alain Finkel

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_a68a.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

completiondomain theorysober spacesNoetherian spacesWSTSforward analysisKarp-Miller procedure

Mathematics Subject Classification ID

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 (21)

Ideal Abstractions for Well-Structured Transition Systems ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Handling infinitely branching well-structured transition systems ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Unnamed Item ⋮ The ideal view on Rackoff's coverability technique ⋮ Unnamed Item ⋮ Coverability Trees for Petri Nets with Unordered Data ⋮ Unnamed Item ⋮ Forward analysis for WSTS, part I: completions ⋮ Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture ⋮ Unnamed Item

This page was built for publication: