| dbo:abstract |
In computer science, a communicating finite-state machine is a finite state machine labeled with "receive" and "send" operations over some alphabet of channels. They were introduced by Brand and Zafiropulo, and can be used as a model of concurrent processes like Petri nets. Communicating finite state machines are used frequently for modeling a communication protocol since they make it possible to detect major protocol design errors, including boundedness, deadlocks, and unspecified receptions. The advantage of communicating finite state machines is that they make it possible to decide many properties in communication protocols, beyond the level of just detecting such properties. This advantage rules out the need for human assistance or restriction in generality. Communicating finite state machines can be more powerful than finite state machines in situations where the propagation delay is not negligible (so that several messages can be in transit at one time) and in situations where it is natural to describe the protocol parties and the communication medium as separate entities. (en) |
| dbo:wikiPageID |
38734569 (xsd:integer) |
| dbo:wikiPageLength |
8549 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
972221538 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Concurrency_(computer_science) dbr:Computer_science dbc:Concurrency_(computer_science) dbc:Models_of_computation dbr:Petri_nets dbr:Finite_state_machine |
| dbp:wikiPageUsesTemplate |
dbt:Main dbt:R |
| dct:subject |
dbc:Concurrency_(computer_science) dbc:Models_of_computation |
| gold:hypernym |
dbr:Machine |
| rdf:type |
dbo:Software yago:WikicatModelsOfComputation yago:Assistant109815790 yago:CausalAgent100007347 yago:LivingThing100004258 yago:Model110324560 yago:Object100002684 yago:Organism100004475 yago:Person100007846 yago:PhysicalEntity100001930 yago:Worker109632518 yago:YagoLegalActor yago:YagoLegalActorGeo yago:Whole100003553 |
| rdfs:comment |
In computer science, a communicating finite-state machine is a finite state machine labeled with "receive" and "send" operations over some alphabet of channels. They were introduced by Brand and Zafiropulo, and can be used as a model of concurrent processes like Petri nets. Communicating finite state machines are used frequently for modeling a communication protocol since they make it possible to detect major protocol design errors, including boundedness, deadlocks, and unspecified receptions. (en) |
| rdfs:label |
Communicating finite-state machine (en) |
| owl:sameAs |
freebase:Communicating finite-state machine yago-res:Communicating finite-state machine wikidata:Communicating finite-state machine https://global.dbpedia.org/id/fKWj |
| prov:wasDerivedFrom |
wikipedia-en:Communicating_finite-state_machine?oldid=972221538&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Communicating_finite-state_machine |
| is dbo:wikiPageRedirects of |
dbr:Communicating_finite-state_machines |
| is dbo:wikiPageWikiLink of |
dbr:Communicating_finite-state_machines dbr:Reachability_analysis dbr:Channel_system_(computer_science) dbr:Vector_addition_system dbr:Finite-state_machine |
| is foaf:primaryTopic of |
wikipedia-en:Communicating_finite-state_machine |