Name
Abstract | ||
|---|---|---|
Existential bounded communication of a communicating finite-state machine means that runs can be scheduled in such a way that message channels are always bounded in size by a value that depends only on the machine. This notion leads to regular sets of representative executions, which allows to get effective algorithms. We show in this paper the equivalence of several formalisms over existentially bounded models: monadic second order logic, communicating automata and globally-cooperative compositional MSC-graphs. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30550-7_4 | Developments in Language Theory |
Keywords | Field | DocType |
existential bounded communication,kleene theorem,existentially bounded model,representative execution,message channel,finite-state machine,globally-cooperative compositional msc-graphs,regular set,order logic,effective algorithm | Kleene algebra,Discrete mathematics,Algebra,Second-order logic,Computer science,Automaton,Algorithm,Finite-state machine,Equivalence (measure theory),Rotation formalisms in three dimensions,Monadic predicate calculus,Bounded function | Conference |
Volume | ISSN | ISBN |
3340 | 0302-9743 | 3-540-24014-4 |
Citations | PageRank | References |
16 | 0.85 | 25 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Blaise Genest | 1 | 304 | 25.09 |
| Anca Muscholl | 2 | 1179 | 74.92 |
| Dietrich Kuske | 3 | 485 | 47.93 |