Symbolic Analysis for GSMP Models with One Stateful Clock

DOI10.1007/978-3-540-71493-4_10MaRDI QIDQ3612961zbMATH OpenOpenAlexFDO

Authors Mikhail Bernadsky, Rajeev Alur

Publication date 11 March 2009

Published in Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://repository.upenn.edu/cis_papers/502

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Attainable sets, reachability (93B03) Stochastic systems in control theory (general) (93E03)

Recommendations

• Hybrid Systems: Computation and Control
• Symbolic model checking for probabilistic timed automata
• Formal Methods for the Design of Real-Time Systems
• When are stochastic transition systems tameable?
• Symbolic model checking for real-time systems

Cited in

(6)

• When are stochastic transition systems tameable?
• A maximal entropy stochastic process for a timed automaton
• Fixed-delay events in generalized semi-Markov processes revisited
• Performance evaluation of schedulers in a probabilistic setting
• On transience and recurrence in irreducible finite-state stochastic systems
• Hybrid Systems: Computation and Control

Describes a project that uses

Uses Software

• ESP

This page was built for publication: Symbolic Analysis for GSMP Models with One Stateful Clock

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612961)