The following pages link to (Q4038723):
Displaying 50 items.
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Confluence reduction for Markov automata (Q507382) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- Game-theoretic simulation checking tool (Q764005) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- Cones and foci: A mechanical framework for protocol verification (Q853730) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict (Q1124364) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Proving finiteness of CCS processes by non-standard semantics (Q1323345) (← links)
- Deciding true concurrency equivalences on safe, finite nets (Q1365677) (← links)
- Complexity of equivalence problems for concurrent systems of finite agents (Q1383143) (← links)
- Essential transitions to bisimulation equivalences (Q1391753) (← links)
- Parity game reductions (Q1656552) (← links)
- A partial order approach to branching time logic model checking. (Q1854268) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Timing and causality in process algebra (Q1924998) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- On the semantics of polychronous polytimed specifications (Q1996008) (← links)
- On the probabilistic bisimulation spectrum with silent moves (Q2182668) (← links)
- A complete axiomatization of weighted branching bisimulation (Q2182679) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- Investigating single-type structural elements of a component Petri net during component modeling and analysis of a complex system with parallelism (Q2263225) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Next-preserving branching bisimulation (Q2355689) (← links)
- Generating BDDs for symbolic model checking in CCS (Q2365568) (← links)
- An efficient simulation algorithm on Kripke structures (Q2453984) (← links)
- Deciding orthogonal bisimulation (Q2461535) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications (Q2665348) (← links)
- Branching Bisimulation Games (Q2827464) (← links)
- Distributed branching bisimulation reduction of state spaces (Q2845494) (← links)
- Folk Theorems on the Correspondence between State-Based and Event-Based Systems (Q3075540) (← links)
- Computing Stuttering Simulations (Q3184698) (← links)
- On the Minimisation of Acyclic Models (Q3541025) (← links)
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
- Thread algebra for noninterference (Q3625692) (← links)
- Compositionality in state space verification methods (Q4633153) (← links)
- (Q5089272) (← links)
- (Q5119395) (← links)
- (Q5155676) (← links)
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems (Q5164166) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
- Smaller Abstractions for ∀CTL* without Next (Q5187833) (← links)
- Checking equivalences between concurrent systems of finite agents (Extended abstract) (Q5204358) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
