The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages.
Danièle BeauquierAnatol SlissenkoPublished in: TAPSOFT (1997)
Keyphrases
- model checking
- high level
- temporal logic
- timed automata
- orders of magnitude
- finite state machines
- reachability analysis
- epistemic logic
- temporal properties
- partial order reduction
- deterministic finite automaton
- process algebra
- symbolic model checking
- transition systems
- graph theory
- concurrent systems
- formal semantics
- bounded model checking
- finite state
- reinforcement learning