research-article

Public Access

Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems

Authors:

Viorel Preoteasa and

Stavros TripakisAuthors Info & Claims

LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

July 2016

Pages 768 - 777

https://doi.org/10.1145/2933575.2934503

Published: 05 July 2016 Publication History

Abstract

Feedback is an essential composition operator in many classes of reactive and other systems. This paper studies feedback in the context of compositional theories with refinement. Such theories allow to reason about systems on a component-by-component basis, and to characterize substitutability as a refinement relation. Although compositional theories of feedback do exist, they are limited either to deterministic systems (functions) or input-receptive systems (total relations). In this work we propose a compositional theory of feedback which applies to non-deterministic and non-input-receptive systems (e.g., partial relations). To achieve this, we use the semantic frameworks of predicate and property transformers, and relations with fail and unknown values. We show how to define instantaneous feedback for stateless systems and feedback with unit delay for stateful systems. Both operations preserve the refinement relation, and both can be applied to non-deterministic and non-input-receptive systems.

References

[1]

R. Alur and T. Henzinger. Reactive modules. Formal Methods in System Design, 15:7--48, 1999.

Digital Library

[2]

R.-J. Back and M. Butler. Exploring summation and product operators in the refinement calculus. In Mathematics of Program Construction, volume 947 of LNCS. Springer, 1995.

Digital Library

[3]

R.-J. Back and J. von Wright. Refinement Calculus. A systematic Introduction. Springer, 1998.

Digital Library

[4]

G. Berry. The Constructive Semantics of Pure Esterel, 1999.

[5]

M. Broy and K. Stølen. Specification and development of interactive systems: focus on streams, interfaces, and refinement. Springer, 2001.

Digital Library

[6]

B. Davey and H. Priestley. Introduction to lattices and order. Cambridge University Press, New York, second edition, 2002.

[7]

L. de Alfaro. Game models for open systems. In N. Dershowitz, editor, Verification: Theory and Practice, volume 2772 of Lecture Notes in Computer Science, pages 192--213. Springer, 2004.

[8]

L. de Alfaro and T. Henzinger. Interface automata. In Foundations of Software Engineering (FSE). ACM Press, 2001.

Digital Library

[9]

L. Doyen, T. Henzinger, B. Jobstmann, and T. Petrov. Interface theories with component reuse. In EMSOFT, pages 79--88, 2008.

Digital Library

[10]

S. Edwards and E. Lee. The semantics and execution of a synchronous block-diagram language. Sci. Comp. Progr., 48:21--42(22), July 2003.

Digital Library

[11]

T. Freeman and F. Pfenning. Refinement Types for ML. SIGPLAN Not., 26(6):268--277, May 1991.

Digital Library

[12]

X. Jin, J. Deshmukh, J. Kapinski, K. Ueda, and K. Butts. Benchmarks for model transformations and conformance checking. In 1st Intl. Workshop on Applied Verification for Continuous and Hybrid Systems (ARCH), 2014. Benchmark Simulink models available from http://cps-vo.org/group/ARCH/benchmarks.

[13]

X. Jin, J. V. Deshmukh, J. Kapinski, K. Ueda, and K. Butts. Powertrain control verification benchmark. In 17th Intl. Conf. on Hybrid Systems: Computation and Control, HSCC '14, pages 253--262. ACM, 2014.

Digital Library

[14]

B. Jonsson. A fully abstract trace model for dataflow and asynchronous networks. Distrib. Comput., 7(4):197--212, 1994.

Digital Library

[15]

G. Kahn. The semantics of a simple language for parallel programming. In Information Processing 74, Proceedings of IFIP Congress 74. North-Holland, 1974.

[16]

N. Lynch and M. Tuttle. An introduction to input/output automata. CWI Quarterly, 2:219--246, 1989.

[17]

S. Malik. Analysis of cyclic combinational circuits. IEEE Trans. Computer-Aided Design, 13(7):950--956, 1994.

Digital Library

[18]

J. K. Millen. Hookup security for synchronous machines. In Computer Security Foundations Workshop III, pages 84--90, 1990.

[19]

R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, Cambridge, MA, USA, 1990.

Digital Library

[20]

T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL --- A Proof Assistant for Higher-Order Logic. LNCS 2283. Springer, 2002.

Digital Library

[21]

G. D. Plotkin. A powerdomain construction. SIAM Journal on Computing, 5(3):452--487, 1976.

[22]

A. Pnueli. The temporal logic of programs. In FOCS, 1977.

Digital Library

[23]

V. Preoteasa. Formalization of refinement calculus for reactive systems. Archive of Formal Proofs, Oct. 2014. ISSN 2150-914x. http://afp.sf.net/entries/RefinementReactive.shtml.

[24]

V. Preoteasa and S. Tripakis. Refinement calculus of reactive systems. In Embedded Software (EMSOFT). ACM, 2014.

Digital Library

[25]

V. Preoteasa and S. Tripakis. Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems. ArXiv e-prints, Submitted on 21 Oct 2015, last revised 27 Apr 2016 (version 3). URL http://arxiv.org/abs/1510.06379.

[26]

P. M. Rondon, M. Kawaguci, and R. Jhala. Liquid types. SIGPLAN Not., 43(6):159--169, 2008.

Digital Library

[27]

S. Tripakis and C. Shaver. Feedback in Synchronous Relational Interfaces. In From Programs to Systems, volume 8415 of LNCS, pages 249--266. Springer, 2014.

[28]

S. Tripakis, B. Lickly, T. A. Henzinger, and E. A. Lee. A Theory of Synchronous Relational Interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS), 33(4), July 2011.

Digital Library

[29]

H. Xi and F. Pfenning. Dependent types in practical programming. In POPL, pages 214--227. ACM, 1999.

Digital Library

Cited By

Shankar SPinisetty S(2023)Serial Compositional Runtime Enforcement of Safety Timed PropertiesProceedings of the 16th Innovations in Software Engineering Conference10.1145/3578527.3578529(1-11)Online publication date: 23-Feb-2023
https://dl.acm.org/doi/10.1145/3578527.3578529
Preoteasa VDragomir ITripakis S(2021)The refinement calculus of reactive systemsInformation and Computation10.1016/j.ic.2021.104819(104819)Online publication date: Nov-2021
https://doi.org/10.1016/j.ic.2021.104819
Dragomir IPreoteasa VTripakis S(2020)The Refinement Calculus of Reactive Systems ToolsetInternational Journal on Software Tools for Technology Transfer10.1007/s10009-020-00561-4Online publication date: 7-Apr-2020
https://doi.org/10.1007/s10009-020-00561-4
Show More Cited By

Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems

Recommendations

On compositional semantics
COLING '92: Proceedings of the 14th conference on Computational linguistics - Volume 1

We prove a theorem stating that any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when one requires compositional semantics to be "...
Read More
On input-revolving deterministic and nondeterministic finite automata

We introduce and investigate input-revolving finite automata, which are (nondeterministic) finite state automata with the additional ability to shift the remaining part of the input. Three different modes of shifting are considered, namely revolving to ...
Read More
Strictly deterministic CD-systems of restarting automata
FCT'07: Proceedings of the 16th international conference on Fundamentals of Computation Theory

A CD-system of restarting automata is called strictly deterministic if all its component systems are deterministic, and if there is a unique successor system for each component. Here we show that the strictly deterministic CD-systems of restarting ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

July 2016

901 pages

ISBN:9781450343916

DOI:10.1145/2933575

Conference Chair:
Eric Koskinen,
General Chair:
Martin Grohe,
Program Chair:
Natarajan Shankar

Copyright © 2016 ACM.

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 the author(s) 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].

Sponsors

SIGLOG: ACM Special Interest Group on Logic and Computation
EACSL: European Association for Computer Science Logic
IEEE-CS\DATC: IEEE Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 July 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

Academy of Finland
National Science Foundation

Conference

LICS '16

Sponsor:

SIGLOG
EACSL
IEEE-CS\DATC

LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science

July 5 - 8, 2016

NY, New York, USA

Acceptance Rates

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
222
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)8

Other Metrics

View Author Metrics

Citations

Cited By

Shankar SPinisetty S(2023)Serial Compositional Runtime Enforcement of Safety Timed PropertiesProceedings of the 16th Innovations in Software Engineering Conference10.1145/3578527.3578529(1-11)Online publication date: 23-Feb-2023
https://dl.acm.org/doi/10.1145/3578527.3578529
Preoteasa VDragomir ITripakis S(2021)The refinement calculus of reactive systemsInformation and Computation10.1016/j.ic.2021.104819(104819)Online publication date: Nov-2021
https://doi.org/10.1016/j.ic.2021.104819
Dragomir IPreoteasa VTripakis S(2020)The Refinement Calculus of Reactive Systems ToolsetInternational Journal on Software Tools for Technology Transfer10.1007/s10009-020-00561-4Online publication date: 7-Apr-2020
https://doi.org/10.1007/s10009-020-00561-4
Roehm HOehlerking JWoehrle MAlthoff M(2019)Model Conformance for Cyber-Physical SystemsACM Transactions on Cyber-Physical Systems10.1145/33061573:3(1-26)Online publication date: 20-Aug-2019
https://dl.acm.org/doi/10.1145/3306157
Preoteasa VDragomir ITripakis S(2019)Mechanically Proving Determinacy of Hierarchical Block Diagram TranslationsVerification, Model Checking, and Abstract Interpretation10.1007/978-3-030-11245-5_27(577-600)Online publication date: 11-Jan-2019
https://doi.org/10.1007/978-3-030-11245-5_27
Filippidis IMurray R(2018)Layering Assume-Guarantee Contracts for Hierarchical System DesignProceedings of the IEEE10.1109/JPROC.2018.2834926106:9(1616-1654)Online publication date: Sep-2018
https://doi.org/10.1109/JPROC.2018.2834926
Alur RTripakis S(2017)Automatic Synthesis of Distributed ProtocolsACM SIGACT News10.1145/3061640.306165248:1(55-90)Online publication date: 10-Mar-2017
https://dl.acm.org/doi/10.1145/3061640.3061652
Preoteasa VDragomir ITripakis S(2017)Type Inference of Simulink Hierarchical Block Diagrams in IsabelleFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-319-60225-7_14(194-209)Online publication date: 28-May-2017
https://doi.org/10.1007/978-3-319-60225-7_14
Tripakis S(2016)Compositional Model-Based System Design and Other Foundations for Mastering ChangeTransactions on Foundations for Mastering Change I10.1007/978-3-319-46508-1_7(113-129)Online publication date: 23-Sep-2016
https://doi.org/10.1007/978-3-319-46508-1_7
Dragomir IPreoteasa VTripakis S(2016)Compositional Semantics and Analysis of Hierarchical Block DiagramsModel Checking Software10.1007/978-3-319-32582-8_3(38-56)Online publication date: 8-Apr-2016
https://doi.org/10.1007/978-3-319-32582-8_3

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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

Media

Figures

Other

Tables

View Table of Contents