PRISM probabilistic model checker
E824082
PRISM probabilistic model checker is a formal verification tool used to model, analyze, and verify systems that exhibit probabilistic behavior, such as randomized algorithms and communication or security protocols.
All labels observed (1)
| Label | Occurrences |
|---|---|
| PRISM probabilistic model checker canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9838671 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: PRISM probabilistic model checker Context triple: [Marta Kwiatkowska, notableWork, PRISM probabilistic model checker]
-
A.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
B.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
C.
FDR model checker
FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
-
D.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: PRISM probabilistic model checker Target entity description: PRISM probabilistic model checker is a formal verification tool used to model, analyze, and verify systems that exhibit probabilistic behavior, such as randomized algorithms and communication or security protocols.
-
A.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
B.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
C.
FDR model checker
FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
-
D.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
Statements (55)
| Predicate | Object |
|---|---|
| instanceOf |
formal verification tool
ⓘ
model checking tool ⓘ probabilistic model checker ⓘ software tool ⓘ |
| developedAt | University of Birmingham NERFINISHED ⓘ |
| developedInCountry | United Kingdom NERFINISHED ⓘ |
| firstReleaseYear | early 2000s ⓘ |
| hasApplicationDomain |
autonomous systems
ⓘ
computer networks ⓘ embedded systems ⓘ security and cryptographic protocols ⓘ systems biology ⓘ |
| hasDeveloper |
David Parker
NERFINISHED
ⓘ
Gethin Norman NERFINISHED ⓘ Marta Kwiatkowska NERFINISHED ⓘ |
| hasFeature |
command-line interface
ⓘ
counterexample generation (for some model types) ⓘ explicit-state model checking ⓘ graphical user interface ⓘ hybrid symbolic-explicit model checking ⓘ parametric model checking (via extensions) ⓘ reachability analysis ⓘ reward and cost analysis ⓘ scripting support ⓘ simulation-based analysis ⓘ steady-state analysis ⓘ symbolic model checking ⓘ transient analysis ⓘ |
| hasInputLanguage |
PRISM modeling language
NERFINISHED
ⓘ
PRISM property specification language NERFINISHED ⓘ |
| hasLicense | GPL-compatible open-source license ⓘ |
| hasName | PRISM NERFINISHED ⓘ |
| hasWebsite | http://www.prismmodelchecker.org ⓘ |
| isFreeSoftware | true ⓘ |
| supportsModelType |
Markov decision process
NERFINISHED
ⓘ
continuous-time Markov chain ⓘ discrete-time Markov chain ⓘ probabilistic automaton ⓘ stochastic game ⓘ |
| supportsPlatform |
Linux
ⓘ
Windows ⓘ macOS ⓘ |
| supportsPropertyLogic |
CSL
GENERATED
ⓘ
LTL GENERATED ⓘ PCTL GENERATED ⓘ reward-based properties GENERATED ⓘ |
| usedFor |
analysis of communication protocols
ⓘ
analysis of randomized algorithms ⓘ analysis of security protocols ⓘ dependability analysis ⓘ performance evaluation ⓘ quantitative verification ⓘ reliability analysis ⓘ verification of probabilistic systems ⓘ |
| writtenInProgrammingLanguage | Java NERFINISHED ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: PRISM probabilistic model checker Description of subject: PRISM probabilistic model checker is a formal verification tool used to model, analyze, and verify systems that exhibit probabilistic behavior, such as randomized algorithms and communication or security protocols.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.