The following pages link to (Q3792217):
Displayed 20 items.
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- Compositional checking of satisfaction (Q685107) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- A functional programming approach to the specification and verification of concurrent systems (Q909439) (← links)
- A refinement calculus for specifications in Hennessy-Milner logic with recursion (Q911261) (← links)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Duality for modal \(\mu\)-logics (Q1128984) (← links)
- Bisimulation through probabilistic testing (Q1175940) (← links)
- A note on model checking the modal \(\nu\)-calculus (Q1176250) (← links)
- A compositional \(\mu\)-calculus proof system for statecharts processes (Q1285661) (← links)
- A complete modal proof system for HAL: the Herbrand agent language (Q1311969) (← links)
- Model checking and boolean graphs (Q1325844) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus (Q1801498) (← links)
- A modal logic for message passing processes (Q1894680) (← links)
- Complete proof systems for weighted modal logic (Q2253184) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Computation Tree Regular Logic for Genetic Regulatory Networks (Q3540063) (← links)