Model Checking the STL Time-Bounded Until on Hybrid Petri Nets Using Nef Polyhedra.
Adrian GoddeAnne RemkePublished in: EPEW (2017)
Keyphrases
- petri net
- model checking
- partial order reduction
- temporal logic
- reactive systems
- concurrent systems
- process algebra
- discrete event systems
- automated verification
- model checker
- formal verification
- transition systems
- temporal properties
- service composition
- web service composition
- finite state machines
- symbolic model checking
- colored petri nets
- bounded model checking
- formal specification
- verification method
- formal methods
- epistemic logic
- process model
- timed automata
- artificial intelligence
- software engineering