default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSajed Miremadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Johan Lidén Eddeland
, Koen Claessen, Nicholas Smallbone, Zahra Ramezani, Sajed Miremadi, Knut Åkesson:
Enhancing Temporal Logic Falsification With Specification Transformation and Valued Booleans. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(12): 5247-5260 (2020)- [c15]Johan Lidén Eddeland, Sajed Miremadi, Knut Åkesson:
Evaluating Optimization Solvers and Robust Semantics for Simulation-Based Falsification. ARCH 2020: 259-266 - [c14]Johan Lidén Eddeland, Alexandre Donzé, Sajed Miremadi, Knut Åkesson:
Industrial Temporal Logic Specifications for Falsification of Cyber-Physical Systems. ARCH 2020: 267-274
2010 – 2019
- 2019
- [i1]Johan Lidén Eddeland, Koen Claessen, Nicholas Smallbone, Zahra Ramezani, Sajed Miremadi, Knut Åkesson:
Enhancing Temporal Logic Falsification with Specification Transformation and Valued Booleans. CoRR abs/1910.08306 (2019) - 2018
- [c13]Koen Claessen, Nicholas Smallbone, Johan Lidén Eddeland, Zahra Ramezani, Knut Åkesson, Sajed Miremadi:
Applying Valued Booleans in Testing of Cyber-Physical Systems. MT@CPSWeek 2018: 8-9 - 2017
- [c12]Johan Lidén Eddeland, Sajed Miremadi, Martin Fabian, Knut Åkesson:
Objective functions for falsification of signal temporal logic properties in cyber-physical systems. CASE 2017: 1326-1331 - 2016
- [j9]Sajed Miremadi, Bengt Lennartson:
Symbolic On-the-Fly Synthesis in Supervisory Control Theory. IEEE Trans. Control. Syst. Technol. 24(5): 1705-1716 (2016) - 2015
- [j8]Zhennan Fei, Spyros A. Reveliotis, Sajed Miremadi, Knut Åkesson:
A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems. IEEE Trans Autom. Sci. Eng. 12(3): 990-1006 (2015) - [j7]Sajed Miremadi, Zhennan Fei, Knut Åkesson, Bengt Lennartson:
Symbolic Supervisory Control of Timed Discrete Event Systems. IEEE Trans. Control. Syst. Technol. 23(2): 584-597 (2015) - 2014
- [j6]Sajed Miremadi, Zhennan Fei, Knut Åkesson, Bengt Lennartson:
Symbolic Representation and Computation of Timed Discrete-Event Systems. IEEE Trans Autom. Sci. Eng. 11(1): 6-19 (2014) - [j5]Bengt Lennartson, Francesco Basile, Sajed Miremadi, Zhennan Fei, Mona Noori Hosseini, Martin Fabian, Knut Åkesson:
Supervisory Control for State-Vector Transition Models - A Unified Approach. IEEE Trans Autom. Sci. Eng. 11(1): 33-47 (2014) - [j4]Zhennan Fei, Sajed Miremadi, Knut Åkesson, Bengt Lennartson:
Efficient Symbolic Supervisor Synthesis for Extended Finite Automata. IEEE Trans. Control. Syst. Technol. 22(6): 2368-2375 (2014) - 2012
- [b1]Sajed Miremadi:
Symbolic Supervisory Control of Timed Discrete Event Systems. Chalmers University of Technology, Gothenburg, Sweden, 2012 - [j3]Kristofer Bengtsson, Patrik Bergagard, Carl Thorstensson, Bengt Lennartson, Knut Åkesson, Chengyin Yuan, Sajed Miremadi, Petter Falkman:
Sequence Planning Using Multiple and Coordinated Sequences of Operations. IEEE Trans Autom. Sci. Eng. 9(2): 308-319 (2012) - [j2]Sajed Miremadi, Bengt Lennartson, Knut Åkesson:
A BDD-Based Approach for Modeling Plant and Supervisor by Extended Finite Automata. IEEE Trans. Control. Syst. Technol. 20(6): 1421-1435 (2012) - [c11]Zhennan Fei, Sajed Miremadi, Knut Åkesson, Bengt Lennartson:
A symbolic approach to large-scale discrete event systems modeled as finite automata with variables. CASE 2012: 502-507 - [c10]Sajed Miremadi, Zhennan Fei, Knut Åkesson, Bengt Lennartson:
Symbolic computation of nonblocking control function for timed discrete event systems. CDC 2012: 7352-7359 - [c9]Bengt Lennartson, Sajed Miremadi, Zhennan Fei, Mona Noori Hosseini, Martin Fabian, Knut Åkesson:
State-vector transition model applied to supervisory control. ETFA 2012: 1-8 - 2011
- [j1]Sajed Miremadi, Knut Åkesson, Bengt Lennartson:
Symbolic Computation of Reduced Guards in Supervisory Control. IEEE Trans Autom. Sci. Eng. 8(4): 754-765 (2011) - [c8]Sajed Miremadi, Bengt Lennartson, Knut Åkesson:
BDD-based supervisory control on extended finite automata. CASE 2011: 25-31 - [c7]Zhennan Fei, Sajed Miremadi, Knut Åkesson:
Modeling sequential resource allocation systems using Extended Finite Automata. CASE 2011: 444-449 - [c6]Mohammad Reza Shoaei, Sajed Miremadi, Kristofer Bengtsson, Bengt Lennartson:
Reduced-order synthesis of operation sequences. ETFA 2011: 1-8 - [c5]Zhennan Fei, Sajed Miremadi, Knut Åkesson, Bengt Lennartson:
Efficient Symbolic Supervisory Synthesis and Guard Generation - Evaluating Partitioning Techniques for the State-space Exploration. ICAART (1) 2011: 106-115 - [c4]Zhennan Fei, Sajed Miremadi, Knut Åkesson, Bengt Lennartson:
Symbolic State-Space Exploration and Guard Generation in Supervisory Control Theory. ICAART (Revised Selected Papers) 2011: 161-175 - 2010
- [c3]Mohammad Reza Shoaei, Bengt Lennartson, Sajed Miremadi:
Automatic generation of controllers for collision-free flexible manufacturing systems. CASE 2010: 368-373 - [c2]Kristofer Bengtsson, Carl Thorstensson, Bengt Lennartson, Knut Åkesson, Chengyin Yuan, Sajed Miremadi, Petter Falkman:
Relations identification and visualization for sequence planning and automation design. CASE 2010: 841-848 - [c1]Sajed Miremadi, Knut Åkesson, Bengt Lennartson, Martin Fabian:
Supervisor computation and representation: A case study. WODES 2010: 275-280
Coauthor Index
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-04-25 05:40 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:
