Work

Computing Minimum and Maximum Reachability Times in Probabilistic Systems

Year: 1999

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-48320-9_7

Author: Luca de Alfaro

Institution: University of California, Berkeley

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1621538476

FWCI: 3.449

Cites: 23

Cited by: 118

Related to: 10