Categorical foundations for randomly timed automata

DOI10.1016/S0304-3975(02)00894-0zbMath1070.68076OpenAlexW4212827424WikidataQ59196697 ScholiaQ59196697MaRDI QIDQ1884891

António Pacheco, Clàudia Nunes, Amílcar Sernadas, Cristina Sernadas, Manuel Cabral Morais, Paulo Mateus

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00894-0

zbMATH Keywords

AggregationRealizationInterconnectionProbabilistic automatonTimed automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Categories of machines, automata (18B20)

Uses Software

• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition theorem for probabilistic transition systems
• Denotational semantics of object specification
• Machines in a category
• An introduction to the theory of point processes
• Adjoint machines, state-behavior machines, and duality
• Realization theory for automata in categories
• CONCUR '98. Concurrency theory. 9th international conference, Nice, France, September 8--11, 1998. Proceedings
• Exact performance equivalence: An equivalence relation for stochastic automata
• Temporal proof methodologies for timed transition systems
• Composition and behaviors of probabilistic I/O automata
• A Markovian storage model
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• Minimal realization of machines in closed categories
• Expected impulse rewards in Markov regenerative stochastic Petri nets
• Universal aspects of probabilistic automata
• Realization is universal

This page was built for publication: Categorical foundations for randomly timed automata