Trace-based semantics for probabilistic timed I/O automata

Authors:
Sayan Mitra;Nancy Lynch
Affiliations:
MIT Computer Science and AI Laboratory;MIT Computer Science and AI Laboratory
Venue:
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Year:
2007

Citing 4
Cited 3

Domain theory, testing and simulation for labelled Markov processes

Theoretical Computer Science - Foundations of software science and computation structures
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)

The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
Interactive Markov chains: and the quest for quantified quality

Interactive Markov chains: and the quest for quantified quality
Stochastic transition systems for continuous state spaces and non-determinism

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Verifying average dwell time of hybrid systems

ACM Transactions on Embedded Computing Systems (TECS)
An Algebraic Framework for Defining Behaviours of Concurrent Systems. Part 1: The Constructive Presentation

Fundamenta Informaticae
An Algebraic Framework for Defining Random Concurrent Behaviours

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the main features of the Probabilistic Timed I/O Automata (PTIOA)--a framework for modeling and analyzing discretely communicating probabilistic hybrid systems. A PTIOA can choose the post-state of a discrete transition either nondeterministically or according to (possibly continuous) probability distributions. The framework supports modeling of large systems as compositions of concurrently executing PTIOAs, which interact through shared transition labels. We develop a trace-based semantics for PTIOAs and show that PTIOAs are compositional with respect a new notion of external behavior.