Formal verification of real-time systems with preemptive scheduling
From MaRDI portal
Publication:844238
DOI10.1007/s11241-008-9059-0zbMath1185.68429OpenAlexW2086156607MaRDI QIDQ844238
Publication date: 18 January 2010
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-008-9059-0
Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cellular automata (computational aspects) (68Q80)
Related Items (5)
A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems ⋮ Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets ⋮ Symbolic unfolding of parametric stopwatch Petri nets ⋮ A game approach to the parametric control of real-time systems ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- Scheduler modeling based on the controller synthesis paradigm
- Model checking of time Petri nets using the state class timed automaton
- Reachability problems and abstract state spaces for time Petri nets with stopwatches
- A theory of timed automata
- Symbolic model checking for real-time systems
- A causal semantic for time Petri nets
- HyTech: A model checker for hybrid systems
- Schedulability analysis of fixed-priority systems using timed automata
- State space computation and analysis of Time Petri Nets
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Applications and Theory of Petri Nets 2004
- Computer Aided Verification
This page was built for publication: Formal verification of real-time systems with preemptive scheduling
