Pages that link to "Item:Q1188590"
From MaRDI portal
The following pages link to Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings (Q1188590):
Displaying 13 items.
- Safe reasoning with logic LTS (Q549200) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- On model checking multiple hybrid views (Q947781) (← links)
- A partition refinement algorithm for the \(\pi\)-calculus (Q1854406) (← links)
- Module checking (Q1854407) (← links)
- A linear-time branching-time perspective on interface automata (Q2182669) (← links)
- A linear-time-branching-time spectrum for behavioral specification theories (Q2291820) (← links)
- Logical vs. behavioural specifications (Q2304534) (← links)
- A generalised theory of interface automata, component compatibility and error (Q2415373) (← links)
- Error-pruning in interface automata (Q2517232) (← links)
- Interface automata for shared memory (Q2675806) (← links)
- EXPTIME-complete Decision Problems for Modal and Mixed Specifications (Q5170664) (← links)
