scientific article; zbMATH DE number 1759620

zbMATH Open0999.68145MaRDI QIDQ4536611FDOQ4536611

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

Publication date: 25 June 2002

Title of this publication is not available (Why is that?)

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)

Cited In (12)

• Branching-time model-checking of probabilistic pushdown automata
• Title not available (Why is that?)
• Validation of Stochastic Systems
• Stochastic Games with Lossy Channels
• Simulating perfect channels with probabilistic lossy channels
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems
• Model Checking Probabilistic Systems
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Title not available (Why is that?)
• Quantitative analysis of probabilistic lossy channel systems
• Termination Problems in Chemical Kinetics
• Branching-Time Model-Checking of Probabilistic Pushdown Automata

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)