Quantifying the parallelism in BPMN processes using model checking.
Radu MateescuGwen SalaünLina YePublished in: CBSE (2014)
Keyphrases
- model checking
- temporal logic
- process model
- business processes
- formal verification
- finite state
- temporal properties
- formal specification
- model checker
- business process
- business process management
- reachability analysis
- automated verification
- verification method
- formal methods
- computation tree logic
- timed automata
- bounded model checking
- epistemic logic
- transition systems
- symbolic model checking
- finite state machines
- partial order reduction
- process algebra
- pspace complete
- process execution
- workflow management systems
- linear temporal logic
- reactive systems
- state space