Weighted PCL over Product Valuation Monoids

We introduce a weighted propositional configuration logic over a product valuation monoid. Our logic is intended to serve as a specification language for software architectures with quantitative features such as the average of all interactions’ costs of the architecture and the maximum cost among all costs occurring most frequently within a specific number of components in an architecture. We provide formulas of our logic which describe well-known architectures equipped with quantitative characteristics. Moreover, we prove an efficient construction of a full normal form which leads to decidability of equivalence of formulas in this logic.

[1]  Joseph Sifakis,et al.  A general framework for architecture composability , 2014, Formal Aspects of Computing.

[2]  Krishnendu Chatterjee,et al.  Computing Average Response Time , 2018, Principles of Modeling.

[3]  Krishnendu Chatterjee,et al.  Finitary winning in ω-regular games , 2009, TOCL.

[4]  Krishnendu Chatterjee,et al.  Expressiveness and Closure Properties for Quantitative Languages , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[5]  Manfred Droste,et al.  Weighted Automata and Regular Expressions over Valuation Monoids , 2011, Int. J. Found. Comput. Sci..

[6]  Gianluca Rizzo,et al.  A Publish-Subscribe Approach to IoT Integration: The Smart Office Use Case , 2015, 2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops.

[7]  Edward Curry,et al.  Approximate semantic matching of heterogeneous events , 2012, DEBS.

[8]  Joseph Sifakis,et al.  Configuration logics: Modeling architecture styles , 2017, J. Log. Algebraic Methods Program..

[9]  Joseph Sifakis,et al.  Local Reasoning about Parametric and Reconfigurable Component-based Systems , 2019, ArXiv.

[10]  Krishnendu Chatterjee,et al.  Quantitative Automata under Probabilistic Semantics , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[11]  George Rahonis,et al.  Weighted propositional configuration logics: A specification language for architectures with quantitative features. , 2017 .

[12]  Joseph Sifakis,et al.  Configuration Logics: Modelling Architecture Styles , 2015, FACS.

[13]  Manfred Droste,et al.  Weighted automata and weighted MSO logics for average and long-time behaviors , 2012, Inf. Comput..

[14]  Satvik Patel,et al.  Publish/Subscribe Mechanism for IoT: A Survey of Event Matching Algorithms and Open Research Challenges , 2017 .

[15]  Patricia Lago,et al.  How do you Architect your Robots? State of the Practice and Guidelines for ROS-based Systems , 2020, 2020 IEEE/ACM 42nd International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP).

[16]  George Rahonis,et al.  On Weighted Configuration Logics , 2017, FACS.

[17]  Krishnendu Chatterjee,et al.  Quantitative languages , 2008, TOCL.

[18]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[19]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[20]  Xiaohua Jia,et al.  Improving the proof of “Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms” , 2019, PloS one.

[21]  Thomas A. Henzinger,et al.  Quantitative Automata under Probabilistic Semantics , 2019, Log. Methods Comput. Sci..