scientific article; zbMATH DE number 1759620

MaRDI QIDQ4536611zbMATH OpenFDO

Authors Purushothaman Iyer, Parosh A. Abdulla, Christel Baier, Bengt Jonsson

Publication date 25 June 2002

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Simulating perfect channels with probabilistic lossy channels
• scientific article; zbMATH DE number 1956509
• Validation of Stochastic Systems
• scientific article; zbMATH DE number 2038771
• Verification of probabilistic systems with faulty communication

Cited in

(15)

• scientific article; zbMATH DE number 2242597 (Why is no real title available?)
• Model checking probabilistic systems
• Simulating perfect channels with probabilistic lossy channels
• Branching-time model-checking of probabilistic pushdown automata
• Branching-time model-checking of probabilistic pushdown automata
• Decidability of Parameterized Probabilistic Information Flow
• Decisive Markov Chains
• scientific article; zbMATH DE number 1956509 (Why is no real title available?)
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems
• Stochastic Games with Lossy Channels
• scientific article; zbMATH DE number 1735960 (Why is no real title available?)
• Quantitative analysis of probabilistic lossy channel systems
• Validation of Stochastic Systems
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Termination Problems in Chemical Kinetics

This page was built for publication:

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