%0 Conference Proceedings
%T Rule-Based Form for Stream Constraints
%+ Centrum Wiskunde & Informatica (CWI)
%A Dokter, Kasper
%A Arbab, Farhad
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 20th International Conference on Coordination Languages and Models (COORDINATION)
%C Madrid, Spain
%Y Giovanna Di Marzo Serugendo
%Y Michele Loreti
%I Springer International Publishing
%3 Coordination Models and Languages
%V LNCS-10852
%P 142-161
%8 2018-06-18
%D 2018
%R 10.1007/978-3-319-92408-3_6
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01821489/document
%2 https://inria.hal.science/hal-01821489/file/468924_1_En_6_Chapter.pdf
%L hal-01821489
%U https://inria.hal.science/hal-01821489
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-COORDINATION
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-10852