default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahmoud Salamati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Mahmoud Salamati:
Formal Controller Synthesis for Dynamical Systems: Decidability & Scalability. Kaiserslautern University of Technology, Germany, 2024- 2023
- [j3]Rupak Majumdar
, Mahmoud Salamati, Sadegh Soudjani:
Neural Abstraction-Based Controller Synthesis and Deployment. ACM Trans. Embed. Comput. Syst. 22(5s): 141:1-141:25 (2023) - [i6]Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani:
Neural Abstraction-Based Controller Synthesis and Deployment. CoRR abs/2307.03783 (2023) - 2022
- [c6]Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, James Worrell:
The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. MFCS 2022: 40:1-40:13 - [i5]Julian D'Costa, Toghrul Karimov, Joël Ouaknine, Mahmoud Salamati, James Worrell:
The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. CoRR abs/2204.12253 (2022) - [i4]Milad Kazemi, Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani, Ben Wooding:
Data-Driven Abstraction-Based Control Synthesis. CoRR abs/2206.08069 (2022) - 2021
- [c5]Rupak Majumdar, Kaushik Mallik, Mahmoud Salamati, Sadegh Soudjani, Mehrdad Zareian:
Symbolic reach-avoid control of multi-agent systems. ICCPS 2021: 209-220 - [c4]Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, Sadegh Soudjani, James Worrell:
The Pseudo-Skolem Problem is Decidable. MFCS 2021: 34:1-34:21 - 2020
- [j2]Mahmoud Salamati, Sadegh Soudjani, Rupak Majumdar:
A Lyapunov Approach for Time-Bounded Reachability of CTMCs and CTMDPs. ACM Trans. Model. Perform. Evaluation Comput. Syst. 5(1): 2:1-2:29 (2020) - [c3]Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani:
On Decidability of Time-Bounded Reachability in CTMDPs. ICALP 2020: 133:1-133:19 - [i3]Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani:
On Decidability of Time-bounded Reachability in CTMDPs. CoRR abs/2006.05498 (2020)
2010 – 2019
- 2019
- [j1]Mahmoud Salamati, Rocco Salvia, Eva Darulova, Sadegh Soudjani, Rupak Majumdar:
Memory-Efficient Mixed-Precision Implementations for Robust Explicit Model Predictive Control. ACM Trans. Embed. Comput. Syst. 18(5s): 100:1-100:19 (2019) - [c2]Alessandro Abate, Henk A. P. Blom, Nathalie Cauchi, Kurt Degiorgio, Martin Fränzle, Ernst Moritz Hahn, Sofie Haesaert, Hao Ma, Meeko Oishi, Carina Pilch, Anne Remke, Mahmoud Salamati, Sadegh Soudjani, Birgit van Huijgevoort, Abraham P. Vinod:
ARCH-COMP19 Category Report: Stochastic Modelling. ARCH@CPSIoTWeek 2019: 62-102 - [i2]Mahmoud Salamati, Sadegh Soudjani, Rupak Majumdar:
Perception-in-the-Loop Adversarial Examples. CoRR abs/1901.06834 (2019) - [i1]Mahmoud Salamati, Sadegh Soudjani, Rupak Majumdar:
Generalised Bisimulations for Time Bounded Reachability of CTMCs and CTMDPs. CoRR abs/1909.06112 (2019) - 2018
- [c1]Mahmoud Salamati, Sadegh Soudjani, Rupak Majumdar:
Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach. QEST 2018: 389-406
Coauthor Index
aka: Sadegh Soudjani
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
