Towards a unified view of finite automata and semi-Markov flowgraph models

DOI10.1080/03081070902911550zbMath1191.68379OpenAlexW2009353715MaRDI QIDQ3654550

Attila Csenki

Publication date: 6 January 2010

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081070902911550

zbMATH Keywords

fixed point theoremsfinite automatonlanguage equationrenewal argumentcrossdisciplinary problem solvingsemi-Markov flowgraph

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Formal languages and automata (68Q45) Applications of operator theory in probability theory and statistics (47N30)

Cites Work

• A completeness theorem for Kleene algebras and the algebra of regular events
• Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations
• Multistate Models, Flowgraph Models, and Semi-Markov Processes
• Fixed point theorems in ordered abstract spaces
• Flowgraph Models for Multistate Time‐to‐Event Data
• Joint availability of systems modelled by finite semi–markov processes
• Total cumulative work until failure of a system modelled by a finite semi-Markov process
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards a unified view of finite automata and semi-Markov flowgraph models