Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SAC
2009
ACM

favoriteEmaildiscussreport

92views Applied Computing» more SAC 2009»

Decomposing port automata

13 years 11 months ago

Decomposing port automata

Download homepages.cwi.nl

Port automata are an operational model for component connectors in a coordination language such as Reo. They describe which sets of ports can synchronize in each state of the connector being modelled. This paper presents decomposition theorems for port automata, namely that all (ﬁnite) port automata can be generated from a small set of primitive port automata. Applying these results to component connectors means that all component connectors can be constructed from just two primitive connectors.

Christian Koehler, Dave Clarke

Real-time Traffic

Applied Computing | Component Connectors | Port Automata | Primitive Port Automata | SAC 2009 |

claim paper

Related Content

» Decomposing Verification of Timed IO Automata

» On Timing Analysis of Combinational Circuits

» Analysis of large clock meshes via harmonicweighted model order reduction and port sliding

» Testing InputOutput Partial Order Automata

» Partial Order Reduction for Verification of RealTime Components

» Communication Scheduling

» Simulations of Weighted Tree Automata

» On the structure of graphs in the Caucal hierarchy

» Concurrent LSC Verification On Decomposition Properties of Partially Ordered Symbolic Auto...

Post Info
More Details (n/a)

Added	19 May 2010
Updated	19 May 2010
Type	Conference
Year	2009
Where	SAC
Authors	Christian Koehler, Dave Clarke

Comments (0)