Pages that link to "Item:Q5277714"
From MaRDI portal
The following pages link to A classification of symbolic transition systems (Q5277714):
Displaying 16 items.
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- Weighted o-minimal hybrid systems (Q636266) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- A deductive approach towards reasoning about algebraic transition systems (Q1666122) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications (Q2665348) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- Model Refinement Using Bisimulation Quotients (Q3067468) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (Q3618568) (← links)
- Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables (Q3637253) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- Probabilistic and Topological Semantics for Timed Automata (Q5458833) (← links)
