research-article

Decomposing port automata

Authors:

Christian Koehler,

Dave ClarkeAuthors Info & Claims

SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing

Pages 1369 - 1373

https://doi.org/10.1145/1529282.1529587

Published: 08 March 2009 Publication History

Get Access

Abstract

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 (finite) 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.

References

[1]

F. Arbab. Reo: a Channel-based Coordination Model for Component Composition. Mathematical Structures in Computer Science, 14: 329--366, 2004.

Digital Library

Google Scholar

[2]

F. Arbab, C. Baier, F. S. de Boer, J. J. M. M. Rutten, and M. Sirjani. Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications. In COORDINATION 2005, volume 3454 of Lecture Notes in Computer Science, pages 236--251. Springer, 2005.

Digital Library

Google Scholar

[3]

F. Arbab, C. Baier, J. Rutten, and M. Sirjani. Modeling Component Connectors in Reo by Constraint Automata. Science of Computer Programming, 61: 75--113, 2006.

Digital Library

Google Scholar

[4]

R. Bruni, I. Lanese, and U. Montanari. A basic Algebra of Stateless Connectors. Theoretical Computer Science, 366(1): 98--120, 2006.

Digital Library

Google Scholar

[5]

D. Clarke, D. Costa, and F. Arbab. Connector Colouring I: Synchronisation and Context Dependency. Science of Computer Programming, 66(3): 205--22, 2007.

Digital Library

Google Scholar

[6]

D. Gelernter and N. Carriero. Coordination Languages and their Significance. Commun. ACM, 35(2): 97--107, 1992.

Digital Library

Google Scholar

[7]

K. Krohn and J. Rhodes. Algebraic Theory of Machines I: Prime Decomposition Theorems for Finite Semigroups and Machines. Transactions of the American Mathematical Society, 116: 450--464, 1965.

Crossref

Google Scholar

[8]

R. Milner. Calculi for Synchrony and Asynchrony. Theoretical Computer Science, 25: 267--310, 1983.

Google Scholar

[9]

R. Milner. Communication and Concurrency. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989.

Digital Library

Google Scholar

Cited By

View all

ter Beek MHennicker RProença J(2024)Team Automata: Overview and RoadmapCoordination Models and Languages10.1007/978-3-031-62697-5_10(161-198)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62697-5_10
Kautz ORumpe BWortmann A(2020)Automated semantics-preserving parallel decomposition of finite component and connector architecturesAutomated Software Engineering10.1007/s10515-020-00268-5Online publication date: 16-Apr-2020
https://doi.org/10.1007/s10515-020-00268-5
Proença JMadeira A(2019)Taming Hierarchical ConnectorsFundamentals of Software Engineering10.1007/978-3-030-31517-7_13(186-193)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/978-3-030-31517-7_13
Show More Cited By

Recommendations

On stateless multihead automata: Hierarchies and the emptiness problem

We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Interrupt Timed Automata: verification and expressiveness

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.

While the reachability problem is undecidable for ...
Flip-pushdown automata: nondeterminism is better than determinism
DLT'03: Proceedings of the 7th international conference on Developments in language theory

Flip-pushdown automata are pushdown automata with the additional ability to flip or reverse its pushdown. We investigate deterministic and nondeterministic flip-pushdown automata accepting by final state or empty pushdown. In particular, for ...

Comments

Information & Contributors

Information

Published In

SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing

March 2009

2347 pages

ISBN:9781605581668

DOI:10.1145/1529282

Conference Chairs:
Sung Y. Shin
South Dakota State University, United States
,
Sascha Ossowski
University Rey Juan Carlos, Spain

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

SAC09

Sponsor:

SIGAPP

SAC09: The 2009 ACM Symposium on Applied Computing

March 8, 2009 - March 12, 2008

Hawaii, Honolulu

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
159
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

ter Beek MHennicker RProença J(2024)Team Automata: Overview and RoadmapCoordination Models and Languages10.1007/978-3-031-62697-5_10(161-198)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62697-5_10
Kautz ORumpe BWortmann A(2020)Automated semantics-preserving parallel decomposition of finite component and connector architecturesAutomated Software Engineering10.1007/s10515-020-00268-5Online publication date: 16-Apr-2020
https://doi.org/10.1007/s10515-020-00268-5
Proença JMadeira A(2019)Taming Hierarchical ConnectorsFundamentals of Software Engineering10.1007/978-3-030-31517-7_13(186-193)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/978-3-030-31517-7_13
Cruz RProença J(2018)ReoLive: Analysing Connectors in Your BrowserSoftware Technologies: Applications and Foundations10.1007/978-3-030-04771-9_25(336-350)Online publication date: 6-Dec-2018
https://doi.org/10.1007/978-3-030-04771-9_25
Dokter KArbab F(2017)Exposing Latent Mutual Exclusion by Work AutomataTopics in Theoretical Computer Science10.1007/978-3-319-68953-1_6(59-73)Online publication date: 9-Dec-2017
https://doi.org/10.1007/978-3-319-68953-1_6
Kappé TArbab FTalcott C(2017)A Component-Oriented Framework for Autonomous AgentsFormal Aspects of Component Software10.1007/978-3-319-68034-7_2(20-38)Online publication date: 14-Sep-2017
https://doi.org/10.1007/978-3-319-68034-7_2
Jongmans S(2017)(Context-Sensitivity In) Reo, RevisitedFormal Aspects of Component Software10.1007/978-3-319-57666-4_12(191-209)Online publication date: 13-Apr-2017
https://doi.org/10.1007/978-3-319-57666-4_12
Dokter KJongmans SArbab F(2016)Scheduling Games for Concurrent SystemsCoordination Models and Languages10.1007/978-3-319-39519-7_6(84-100)Online publication date: 24-May-2016
https://doi.org/10.1007/978-3-319-39519-7_6
Dokter KJongmans SArbab FBliudze S(2015)Relating BIP and ReoElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.189.3189(3-20)Online publication date: 19-Aug-2015
https://doi.org/10.4204/EPTCS.189.3
Jongmans SArbab F(2013)Modularizing and Specifying Protocols among ThreadsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.109.6109(34-45)Online publication date: 23-Feb-2013
https://doi.org/10.4204/EPTCS.109.6
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Recommendations

On stateless multihead automata: Hierarchies and the emptiness problem

Interrupt Timed Automata: verification and expressiveness

Flip-pushdown automata: nondeterminism is better than determinism

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations