Pages that link to "Item:Q1194331"
From MaRDI portal
The following pages link to Defining conditional independence using collapses (Q1194331):
Displaying 15 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Composing model programs for analysis (Q710670) (← links)
- Relational structures model of concurrency (Q934912) (← links)
- Combining partial-order reductions with on-the-fly model-checking. (Q960506) (← links)
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip (Q1041294) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Proving partial order properties (Q1322161) (← links)
- Applicability of fair simulation (Q1886036) (← links)
- Actor-based model checking for software-defined networks (Q1996852) (← links)
- A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time (Q2453113) (← links)
- Modular Synthesis of Timed Circuits using Partial Orders on LPNs (Q2842584) (← links)
- Partial Order Reduction for Rewriting Semantics of Programming Languages (Q2873775) (← links)
- Partial-Order Reduction (Q3176364) (← links)
- Serializable histories in quantified propositional temporal logic (Q4652741) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
