Pages that link to "Item:Q2760243"
From MaRDI portal
The following pages link to Equivalence and preorder checking for finite-state systems (Q2760243):
Displaying 13 items.
- An invariant-based approach to the verification of asynchronous parameterized networks (Q604385) (← links)
- Approximating Markovian testing equivalence (Q764291) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- An efficient simulation algorithm based on abstract interpretation (Q1049401) (← links)
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems (Q1731513) (← links)
- Program algebra with unit instruction operators (Q1858433) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- An efficient simulation algorithm on Kripke structures (Q2453984) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- (Q4260382) (← links)
- (Q4553282) (← links)
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application (Q5863634) (← links)