Pages that link to "Item:Q1816922"
From MaRDI portal
The following pages link to Compositional minimisation of finite state systems using interface specifications (Q1816922):
Displaying 14 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes (Q856423) (← links)
- Compositional minimisation of finite state systems using interface specifications (Q1816922) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Bisimulation relations for weighted automata (Q2481957) (← links)
- Using heuristic search for finding deadlocks in concurrent systems (Q2573636) (← links)
- Exploiting interleaving semantics in symbolic state-space generation (Q2642670) (← links)
- Decomposing monolithic processes in a process algebra with multi-actions (Q2693301) (← links)
- AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS (Q2842000) (← links)
- Automatic Synthesis of Assumptions for Compositional Model Checking (Q3613064) (← links)
- Refined Interfaces for Compositional Verification (Q3613065) (← links)
- Contracts for BIP: Hierarchical Interaction Models for Compositional Verification (Q3614835) (← links)
- P-Semiflow Computation with Decision Diagrams (Q3636844) (← links)
- Decomposing monolithic processes in a process algebra with multi-actions (Q6649542) (← links)
