Pages that link to "Item:Q5941101"
From MaRDI portal
The following pages link to Well-structured transition systems everywhere! (Q5941101):
Displayed 50 items.
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Applying regions (Q728281) (← links)
- Lost in abstraction: monotonicity in multi-threaded programs (Q729809) (← links)
- Well-structured graph transformation systems (Q729812) (← links)
- Deciding branching time properties for asynchronous programs (Q732003) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Using formal verification to evaluate the execution time of Spark applications (Q782497) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Reduction rules for reset/inhibitor nets (Q847264) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Using well-structured transition systems to decide divergence for catalytic P systems (Q872196) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Theory of interaction (Q896903) (← links)
- Parameterized verification of time-sensitive models of ad hoc network protocols (Q896913) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Computational expressiveness of genetic systems (Q1004070) (← links)
- Soundness-preserving reduction rules for reset workflow nets (Q1007883) (← links)
- On the computational power of BlenX (Q1044845) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- Well-quasi-ordering versus clique-width (Q1745730) (← links)
- A well-structured framework for analysing Petri net extensions (Q1763373) (← links)
- On the computational strength of pure ambient calculi (Q1763730) (← links)
- Parameterized verification of monotone information systems (Q1798673) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- On the expressive power of movement and restriction in pure mobile ambients (Q1881256) (← links)
- Exponential improvement of time complexity of model checking for multiagent systems with perfect recall (Q1938921) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Spatial and behavioral types in the pi-calculus (Q1959478) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- Certifying emptiness of timed Büchi automata (Q1996011) (← links)
- Checking deadlock-freedom of parametric component-based systems (Q1996857) (← links)
- Deadlock detection for actor-based coroutines (Q2024332) (← links)
- Parameterized verification of coverability in infinite state broadcast networks (Q2029598) (← links)
- Lazy controller synthesis for monotone transition systems and directed safety specifications (Q2059378) (← links)
- Computing parameterized invariants of parameterized Petri nets (Q2117165) (← links)
- Abstraction-based incremental inductive coverability for Petri nets (Q2117187) (← links)
- Branch-well-structured transition systems and extensions (Q2165211) (← links)
- SMT-based generation of symbolic automata (Q2182674) (← links)
- The decidability of verification under PS 2.0 (Q2233444) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Run-time complexity bounds using squeezers (Q2233463) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- Some complexity results for stateful network verification (Q2335903) (← links)
- Rational subsets and submonoids of wreath products. (Q2347806) (← links)
- Generalized Post embedding problems (Q2354596) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Advances in parameterized verification of population protocols (Q2399358) (← links)