Well-structured transition systems everywhere!
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5068370
- scientific article; zbMATH DE number 6790161
- Ideal abstractions for well-structured transition systems
- scientific article; zbMATH DE number 2020831
- An exercise on transition systems
- Well structured transition systems with history
- Unfolding Concurrent Well-Structured Transition Systems
- Transition systems
- scientific article; zbMATH DE number 7453189
Cites work
- A note on well quasi-orderings for powersets
- A theory of timed automata
- Algorithmic analysis of programs with well quasi-ordered domains.
- An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
- Characterizing finite Kripke structures in propositional temporal logic
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Deciding properties of integral relational automata
- Ensuring completeness of symbolic verification methods for infinite-state systems
- Fifo nets without order deadlock
- scientific article; zbMATH DE number 1693040 (Why is no real title available?)
- scientific article; zbMATH DE number 1696790 (Why is no real title available?)
- scientific article; zbMATH DE number 3646295 (Why is no real title available?)
- scientific article; zbMATH DE number 3885321 (Why is no real title available?)
- scientific article; zbMATH DE number 4030997 (Why is no real title available?)
- scientific article; zbMATH DE number 4035115 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 42469 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1231560 (Why is no real title available?)
- scientific article; zbMATH DE number 1304329 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1500504 (Why is no real title available?)
- scientific article; zbMATH DE number 1538050 (Why is no real title available?)
- scientific article; zbMATH DE number 219205 (Why is no real title available?)
- scientific article; zbMATH DE number 1860681 (Why is no real title available?)
- Hybrid automata with finite bisimulations
- Infinite results
- On Communicating Finite-State Machines
- On permutative grammars generating context-free languages
- Ordering by Divisibility in Abstract Algebras
- Parallel program schemata
- Priority Networks of Communicating Finite State Machines
- Recursivite et cônes rationnels fermés par intersection
- Reduction and covering of infinite reachability trees
- Some decision problems related to the reachability problem for Petri nets
- Symbolic model checking: \(10^{20}\) states and beyond
- The theory of well-quasi-ordering: a frequently discovered concept
- Undecidable verification problems for programs with unreliable channels
- Unreliable channels are easier to verify than perfect channels
- Verifying programs with unreliable channels
Cited in
(only showing first 100 items - show all)- Computational expressiveness of genetic systems
- Soundness-preserving reduction rules for reset workflow nets
- On the computational power of BlenX
- Well-abstracted transition systems: Application to FIFO automata.
- Handling infinitely branching well-structured transition systems
- An automata-theoretic approach to the verification of distributed algorithms
- Well-quasi-ordering versus clique-width
- A well-structured framework for analysing Petri net extensions
- On the computational strength of pure ambient calculi
- Parameterized verification of monotone information systems
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Algorithmic analysis of programs with well quasi-ordered domains.
- On the expressive power of movement and restriction in pure mobile ambients
- Exponential improvement of time complexity of model checking for multiagent systems with perfect recall
- On termination and invariance for faulty channel machines
- Ordinal theory for expressiveness of well-structured transition systems
- Spatial and behavioral types in the pi-calculus
- Process calculi as a tool for studying coordination, contracts and session types
- Certifying emptiness of timed Büchi automata
- Checking deadlock-freedom of parametric component-based systems
- Deadlock detection for actor-based coroutines
- Parameterized verification of coverability in infinite state broadcast networks
- Lazy controller synthesis for monotone transition systems and directed safety specifications
- Computing parameterized invariants of parameterized Petri nets
- Abstraction-based incremental inductive coverability for Petri nets
- Branch-well-structured transition systems and extensions
- SMT-based generation of symbolic automata
- The decidability of verification under PS 2.0
- Data flow analysis of asynchronous systems using infinite abstract domains
- Run-time complexity bounds using squeezers
- Stratified guarded first-order transition systems
- Computable fixpoints in well-structured symbolic model checking
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- Some complexity results for stateful network verification
- Alternating two-way AC-tree automata
- Advances in parameterized verification of population protocols
- WQO is decidable for factorial languages
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- Quantitative analysis of probabilistic lossy channel systems
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A general approach to comparing infinite-state systems with their finite-state specifications
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- Well-structured languages
- Learning to verify branching time properties
- Alternating complexity of counting first-order logic for the subword order
- Population protocols: beyond runtime analysis
- Weak and nested class memory automata
- On hierarchical communication topologies in the -calculus
- Coverability trees for Petri nets with unordered data
- Unbounded-thread program verification using thread-state equations
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- Decidable classes of unbounded Petri nets with time and urgency
- Well-quasi-ordering does not imply bounded clique-width
- Complexity hierarchies beyond elementary
- The power of well-structured systems
- Well-structured pushdown systems
- Monotonic extensions of Petri nets: forward and backward search revisited
- Well-quasi-ordering hereditarily finite sets
- Expressiveness issues in brane calculi: a survey
- Narrowing and rewriting logic: from foundations to applications
- Local entailment test in the reachability problem for well-structured transition systems
- Ideal abstractions for well-structured transition systems
- Forward analysis and model checking for trace bounded WSTS
- Petri nets with structured data
- Complete abstractions and subclassical modal logics
- Deciding Structural Liveness of Petri Nets
- Ordinal theory for expressiveness of well structured transition systems
- Forward analysis and model checking for trace bounded WSTS
- Multiply-recursive upper bounds with Higman's lemma
- Automatic verification of directory-based consistency protocols with graph constraints
- Well (and better) quasi-ordered transition systems
- Verification of Timed-Arc Petri Nets
- A load-buffer semantics for total store ordering
- Model checking parameterized systems
- Symbolic model checking in non-Boolean domains
- A general framework for well-structured graph transformation systems
- The ideal approach to computing closed subsets in well-quasi-orderings
- Theories of orders on the set of words
- Parameterized verification of coverability in well-structured broadcast networks
- Forward analysis for WSTS, part I: completions
- The Reachability Problem over Infinite Graphs
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
- Tree Pattern Rewriting Systems
- Discovery, Verification and Conformance of Workflows with Cancellation
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- A Biologically Inspired Model with Fusion and Clonation of Membranes
- On selective unboundedness of VASS
- Decidability properties for fragments of CHR
- Event-Clock Visibly Pushdown Automata
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
- On the expressive power of process interruption and compensation
- Automatic Verification of Directory-Based Consistency Protocols
- How to Tackle Integer Weighted Automata Positivity
- On the expressive power of recursion, replication and iteration in process calculi
- scientific article; zbMATH DE number 4030997 (Why is no real title available?)
This page was built for publication: Well-structured transition systems everywhere!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941101)
