Pages that link to "Item:Q5398302"
From MaRDI portal
The following pages link to Business process verification with constraint temporal answer set programming (Q5398302):
Displaying 6 items.
- Efficient semantics-based compliance checking using LTL formulae and unfolding (Q364600) (← links)
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints (Q414857) (← links)
- Algorithm for formal verification of business process templates (Q464876) (← links)
- From generating process views over inter-organizational business processes to achieving their temporal consistency (Q2047507) (← links)
- Determining temporal agreements in cross-organizational business processes (Q2051815) (← links)
- Optimising business process discovery using answer set programming (Q2694620) (← links)