Algorithmic analysis of programs with well quasi-ordered domains.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1678356 (Why is no real title available?)
- scientific article; zbMATH DE number 3566118 (Why is no real title available?)
- Algebra of communicating processes with abstraction
- Analysis of a class of communicating finite state machines
- Decidability of a temporal logic problem for Petri nets
- Deciding properties of integral relational automata
- Hybrid automata with finite bisimulations
- On Communicating Finite-State Machines
- Ordering by Divisibility in Abstract Algebras
- Parallel program schemata
- Property preserving abstractions for the verification of concurrent systems
- Reduction and covering of infinite reachability trees
- Undecidable verification problems for programs with unreliable channels
Cited in
(57)- Reachability problems on reliable and lossy queue automata
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Dynamic networks of timed Petri nets
- Deciding Structural Liveness of Petri Nets
- The ideal view on Rackoff's coverability technique
- The Parametric Complexity of Lossy Counter Machines
- scientific article; zbMATH DE number 4030997 (Why is no real title available?)
- Clique-width and well-quasi-ordering of triangle-free graph classes
- When Is Reachability Intrinsically Decidable?
- Deciding safety properties in infinite-state pi-calculus via behavioural types
- Forward analysis and model checking for trace bounded WSTS
- Well (and better) quasi-ordered transition systems
- The power of well-structured systems
- Run-time complexity bounds using squeezers
- Knowledge acquisition in multi-agent systems: a formalization of the Eleusis card game
- The power of priority channel systems
- On functions weakly computable by pushdown Petri nets and related systems
- Coverability trees for Petri nets with unordered data
- Forward analysis and model checking for trace bounded WSTS
- Universal safety for timed Petri nets is PSPACE-complete
- Forward analysis for WSTS, part I: completions
- Branch-well-structured transition systems and extensions
- Branch-well-structured transition systems and extensions
- Hardness results for coverability problem of well-structured pushdown systems
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- Deciding branching time properties for asynchronous programs
- Forward analysis for WSTS. III: Karp-Miller trees
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- Forward analysis for WSTS. III: Karp-Miller trees
- Well-structured transition systems everywhere!
- Complete abstractions and subclassical modal logics
- Decidability and complexity of Petri nets with unordered data
- Decidability of the analysis problem for dataflow models of programs
- On the expressiveness of mobile synchronizing Petri nets
- scientific article; zbMATH DE number 7453189 (Why is no real title available?)
- Ensuring completeness of symbolic verification methods for infinite-state systems
- Handling Parameterized Systems with Non-atomic Global Conditions
- What's decidable about availability languages?
- Monotonic Abstraction in Action
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Multiply-recursive upper bounds with Higman's lemma
- Parameterized verification under TSO with data types
- Exponential improvement of time complexity of model checking for multiagent systems with perfect recall
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Computable fixpoints in well-structured symbolic model checking
- Handling infinitely branching well-structured transition systems
- Model checking of systems with many identical timed processes
- Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
- Approximated parameterized verification of infinite-state processes with global conditions
- A general approach to comparing infinite-state systems with their finite-state specifications
- Complexity hierarchies beyond elementary
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
- On termination and invariance for faulty channel machines
- The ideal approach to computing closed subsets in well-quasi-orderings
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
- Ordinal recursive complexity of unordered data nets
This page was built for publication: Algorithmic analysis of programs with well quasi-ordered domains.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854355)
