Generating BDDs for symbolic model checking in CCS (Q2365568): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An implementation of an efficient algorithm for bisimulation equivalence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4038723 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finite representations of CCS and TCSP programs by automata and Petri nets / rank | |||
Normal rank | |||
Latest revision as of 16:59, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating BDDs for symbolic model checking in CCS |
scientific article |
Statements
Generating BDDs for symbolic model checking in CCS (English)
0 references
29 June 1993
0 references
process algebra
0 references
model checking
0 references
Binary decision diagram
0 references
transition systems
0 references
CCS
0 references
bisimilarity
0 references
