The following pages link to (Q4240122):
Displayed 27 items.
- Active learning of nondeterministic finite state machines (Q459826) (← links)
- Development of global specification for dynamically adaptive software (Q488401) (← links)
- Property specifications for workflow modelling (Q549695) (← links)
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- Using abduction and induction for operational requirements elaboration (Q833728) (← links)
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning (Q934706) (← links)
- Deriving non-zeno behaviour models from goal models using ILP (Q973050) (← links)
- Automated circular assume-guarantee reasoning (Q1673656) (← links)
- Decompositions of graphs based on a new graph product (Q1735673) (← links)
- On the usability of process algebra: An architectural view (Q1781999) (← links)
- A verification-driven framework for iterative design of controllers (Q2335947) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Architectural concepts and design patterns for behavior modeling and integration (Q2489602) (← links)
- Highly dependable concurrent programming using design for verification (Q2643127) (← links)
- Implied Scenario Detection in the Presence of Behaviour Constraints (Q2841318) (← links)
- (Q2844827) (← links)
- Model-Checking Helena Ensembles with Spin (Q2945715) (← links)
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes (Q3000666) (← links)
- FSP and FLTL framework for specification and verification of middle-agents (Q3016270) (← links)
- Compositional Reasoning (Q3176370) (← links)
- Dynamic Logic with Binders and Its Application to the Development of Reactive Systems (Q3179414) (← links)
- Automated Assume-Guarantee Reasoning by Abstraction Refinement (Q3512489) (← links)
- Teaching Concurrency Concepts to Freshmen (Q3599211) (← links)
- On A Directed Tree Problem Motivated by A Newly Introduced Graph Product (Q5006563) (← links)
- Compositional Specification in Rewriting Logic (Q5108529) (← links)
- Automated Circular Assume-Guarantee Reasoning (Q5206947) (← links)
- Testing Concurrent Objects with Application-Specific Schedulers (Q5505611) (← links)