A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:15, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Kleene theorem and model checking algorithms for existentially bounded communicating automata |
scientific article |
Statements
A Kleene theorem and model checking algorithms for existentially bounded communicating automata (English)
0 references
12 July 2006
0 references
communicating finite state machines
0 references
message sequence charts
0 references
Kleene theorem
0 references
model checking
0 references