"Automata-theoretic modeling of fixed-priority non-preemptive scheduling ..."

Matthias Kauer et al. (2014)

> Home

Details and statistics

DOI: 10.1109/ASPDAC.2014.6742990

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aspdac/KauerS0LC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aspdac/KauerS0LC14
Matthias Kauer, Sebastian Steinhorst, Reinhard Schneider, Martin Lukasiewycz, Samarjit Chakraborty:
Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification. ASP-DAC 2014: 812-817

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.