Anik Momtaz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Anik Momtaz has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Borzoo Bonakdarpour
Michigan State University
6 shared publications - Houssam Abbas
Oregon State University
3 shared publications - Dejan Ničković
AIT Austrian Institute of Technology
2 shared publications - N. Ege Saraç
Institute of Science and Technology Austria (ISTA)
2 shared publications Borzoo Bonakdarpour
Michigan State University {borzoo
1 shared publication- Charles Koll
Oregon State University
1 shared publication
Latest Publications
- Open Access
- 12 October 2024
- Published by Springer Nature
- p. 282-301
Approximate Distributed Monitoring Under Partial Synchrony: Balancing Speed & Accuracy
In distributed systems with processes that do not share a global clock, partial synchrony is achieved by clock synchronization that guarantees bounded clock skew among all applications. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an approximate distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup of the distributed monitors, albeit with a tradeoff in accuracy. We address this tradeoff with a methodology that combines our approximate monitor with its exact counterpart, resulting in enhanced efficiency without sacrificing precision. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.
- 12 October 2024
- Published by Springer Nature
- p. 282-301
Open AccessApproximate Distributed Monitoring Under Partial Synchrony: Balancing Speed & Accuracy
In distributed systems with processes that do not share a global clock, partial synchrony is achieved by clock synchronization that guarantees bounded clock skew among all applications. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an approximate distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup of the distributed monitors, albeit with a tradeoff in accuracy. We address this tradeoff with a methodology that combines our approximate monitor with its exact counterpart, resulting in enhanced efficiency without sacrificing precision. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.
- Open Access
Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed and Accuracy
In distributed systems with processes that do not share a global clock, \emph{partial synchrony} is achieved by clock synchronization that guarantees bounded clock skew among all applications. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an \emph{approximate} distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup of the distributed monitors, albeit with a tradeoff in accuracy. We address this tradeoff with a methodology that combines our approximate monitor with its exact counterpart, resulting in enhanced efficiency without sacrificing precision. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.
Open AccessApproximate Distributed Monitoring under Partial Synchrony: Balancing Speed and Accuracy
In distributed systems with processes that do not share a global clock, \emph{partial synchrony} is achieved by clock synchronization that guarantees bounded clock skew among all applications. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an \emph{approximate} distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup of the distributed monitors, albeit with a tradeoff in accuracy. We address this tradeoff with a methodology that combines our approximate monitor with its exact counterpart, resulting in enhanced efficiency without sacrificing precision. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.
- 14 June 2024
- Published by Springer Nature in Formal Methods in System Design
- Vol. 64 (1-3) , 146-177
Runtime verification of partially-synchronous distributed system
- 14 June 2024
- Published by Springer Nature in Formal Methods in System Design
- Vol. 64 (1-3) , 146-177
Runtime verification of partially-synchronous distributed system
- 1 October 2023
- Published by Springer Nature
- p. 213-230
Decentralized Predicate Detection Over Partially Synchronous Continuous-Time Signals
- 1 October 2023
- Published by Springer Nature
- p. 213-230
Decentralized Predicate Detection Over Partially Synchronous Continuous-Time Signals
- 25 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 221-231
Resource Optimization of Stream Processing in Layered Internet of Things
IoT (Internet of Things) applications often involve stream processing using multiple complex layers of processing nodes, where in each layer, data is received by the nodes, processed, and then transmitted to the nodes in subsequent layers. Such systems present a tradeoff between reliability and resource usage, including CPU power, energy, network band-width, memory, etc. Reducing the reliability at which a node processes inbound data in a layer can have repercussions on nodes in subsequent layers in the network that receive less reliable data, and in turn impact the reliability of the application as a whole. In this paper, we present a generalized model of streaming IoT applications as a layered network of producers and consumers. Our model captures trade-offs between reliability and resource usage of the system. We present an efficient algorithm using SMT constraint solvers to determine the optimal selection of processing quality for each node in the network, such that target system reliability is achieved while respecting the given resource bounds, and resource usage is minimized. In addition, we present a lightweight machine learning based solution to drastically improve our model in terms of run time. We have fully implemented our technique and report experimental results on a layered IoT network.
- 25 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 221-231
Resource Optimization of Stream Processing in Layered Internet of Things
IoT (Internet of Things) applications often involve stream processing using multiple complex layers of processing nodes, where in each layer, data is received by the nodes, processed, and then transmitted to the nodes in subsequent layers. Such systems present a tradeoff between reliability and resource usage, including CPU power, energy, network band-width, memory, etc. Reducing the reliability at which a node processes inbound data in a layer can have repercussions on nodes in subsequent layers in the network that receive less reliable data, and in turn impact the reliability of the application as a whole. In this paper, we present a generalized model of streaming IoT applications as a layered network of producers and consumers. Our model captures trade-offs between reliability and resource usage of the system. We present an efficient algorithm using SMT constraint solvers to determine the optimal selection of processing quality for each node in the network, such that target system reliability is achieved while respecting the given resource bounds, and resource usage is minimized. In addition, we present a lightweight machine learning based solution to drastically improve our model in terms of run time. We have fully implemented our technique and report experimental results on a layered IoT network.
- 1 August 2023
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 25 (4) , 541-556
Predicate monitoring in distributed cyber-physical systems
- 1 August 2023
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 25 (4) , 541-556
Predicate monitoring in distributed cyber-physical systems
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 154-165
Monitoring Signal Temporal Logic in Distributed Cyber-physical Systems
This paper solves the problem of runtime verification for signal temporal logic in distributed cyber-physical systems (CPS). We assume a partially synchronous setting, where a clock synchronization algorithm guarantees a bound on clock drifts among all signals. We introduce a formula progression and a signal retiming technique that allow reasoning about the correctness of formulas among continuous-time and continuous-valued signals that do not share a global view of time. The resulting problem is encoded as a satisfiability modulo theory (SMT) solving problem, and we introduce techniques to solve the SMT encoding efficiently. We also conduct two case studies on monitoring a network of aerial vehicles and a water distribution system.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 154-165
Open AccessMonitoring Signal Temporal Logic in Distributed Cyber-physical Systems
This paper solves the problem of runtime verification for signal temporal logic in distributed cyber-physical systems (CPS). We assume a partially synchronous setting, where a clock synchronization algorithm guarantees a bound on clock drifts among all signals. We introduce a formula progression and a signal retiming technique that allow reasoning about the correctness of formulas among continuous-time and continuous-valued signals that do not share a global view of time. The resulting problem is encoded as a satisfiability modulo theory (SMT) solving problem, and we introduce techniques to solve the SMT encoding efficiently. We also conduct two case studies on monitoring a network of aerial vehicles and a water distribution system.