Skip to Main content Skip to Navigation
Conference papers

Rule-Based Form for Stream Constraints

Abstract : Constraint automata specify protocols as labeled transition systems that preserve synchronization under composition. They have been used as a basis for tools, such as compilers and model checkers. Unfortunately, composition of transition systems suffers from state space and transition space explosions, which limits scalability of the tools based on constraint automata. In this work, we propose stream constraints as an alternative to constraint automata that avoids state space explosions. We introduce a rule-based form for stream constraints that can avoid transition space explosions. We provide sufficient conditions under which our approach avoids transition space explosions.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Friday, June 22, 2018 - 2:55:39 PM
Last modification on : Friday, June 22, 2018 - 3:09:23 PM
Long-term archiving on: : Monday, September 24, 2018 - 11:21:35 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2021-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Kasper Dokter, Farhad Arbab. Rule-Based Form for Stream Constraints. 20th International Conference on Coordination Languages and Models (COORDINATION), Jun 2018, Madrid, Spain. pp.142-161, ⟨10.1007/978-3-319-92408-3_6⟩. ⟨hal-01821489⟩



Record views