A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ic.2006.01.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044184458 / rank | |||
Normal rank | |||
Revision as of 03:08, 20 March 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
