The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets
IEEE Transactions on Software Engineering
Temporal proof methodologies for timed transition systems
Information and Computation
A decomposition theorem for probabilistic transition systems
Theoretical Computer Science
Handbook of logic in computer science (vol. 4)
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
On the verification of qualitative properties of probabilistic processes under fairness constraints
Information Processing Letters
Exact performance equivalence: an equivalence relation for stochastic automata
Theoretical Computer Science
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
Universal Theory of Automata
Automata and Algebras in Categories
Automata and Algebras in Categories
Realization of Probabilistic Automata: Categorial Approach
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Span(Graph): A Categorial Algebra of Transition Systems
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Representing Place/Transition Nets in Span(Graph)
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Expected Impulsive Rewards in Markov Regenerative Stochastic Petri Nets
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Universal aspects of probabilistic automata
Mathematical Structures in Computer Science
Hi-index | 5.23 |
The general theory of randomly timed automata is developed: starting with the practical motivation and presentation of the envisaged notion, the categorical theory of minimization, aggregation, encapsulation, interconnection and realization of such automata is worked out. All these constructions are presented universally: minimization and realization as adjunctions, aggregation as product, interconnection as cartesian lifting, and encapsulation as co-cartesian lifting. Stochastic timed automata are shown to be a particular case of randomly timed automata. The notion of stochastic timed automaton is shown to be too restrictive to establish a self contained theory of combination and realization.