Name
Abstract | ||
|---|---|---|
We address the model-checking problem of viz. communicating finite-state machines (in short, CFSMs) [1,2,6], an infinite system which are modelled as a collection of finite state automata communicating messages through FIFO queues. Several verification methods have been developed for CFSMs. Since all interesting verification problems are undecidable [4], there is in general no completely automatic verification procedure for this class of systems. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11812128_27 | CIAA |
Keywords | Field | DocType |
infinite system,fifo queue,finite-state machine,interesting verification problem,automatic verification procedure,model-checking problem,symbolic model checking,finite state automaton,verification method,finite union,model checking,finite state automata | Model checking,Deterministic automaton,Binary decision diagram,Theoretical computer science,Finite-state machine,Fifo queue,Verification procedure,Mathematics,Undecidable problem | Conference |
Volume | ISSN | ISBN |
4094 | 0302-9743 | 3-540-37213-X |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Suman Roy | 1 | 21 | 7.25 |
| Bhaskar Chakraborty | 2 | 129 | 5.34 |