Faculty

Institution

Unit

Venue

Neda Saeedloei

Assistant Professor

Towson University

Affiliations

Jess & Mildred Fisher College of Science & Mathematics

Department of Computer & Information Sciences

Neda Saeedloei is currently serving as a Computer & Information Sciences Assistant Professor at Towson University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Neda Saeedloei

Towson University

Assistant Professor

You can click a keyword to filter the displayed items

computer science formal methods timed system formal verification systems engineering temporal logic verification theoretical computer science timed scenarios automaton operation operations research system science logic programming timed automata computer engineering cyber-physical systems systems modeling mathematical optimization computational optimization automated reasoning programming languages design automation discrete algorithms model verification automaton network applied mathematics machine learning approximate reasoning logic in computer science timing analysis scheduling analysis logical automaton numerical algorithms mathematical programming combinatorial optimization operation management combinatorial theory verification and validation cps security computational logic real-time algorithms time delay systems model checking constraint programming constraint satisfaction programming language theory scheduling problems clock synchronization computability theory real-time system design tree automaton logic-based modeling infinite computation definite clause omega-grammars clock allocation clock-efficient timed automata minimal numbers logical encoding model-based design

Notable Scholarly Works

Notable Federal Grants

Collaborators

Generating Timed Scenarios From Behaviours. Studies in computational intelligence (2024)

systems engineeringtemporal logicsystem sciencesystems modelingformal verificationtimed scenariostimed systemformal methods

On the Existence of Unions of Timed Scenarios. Lecture notes in computer science (2024)

temporal logicset theorysystem sciencemathematicstimed scenariostimed system

Synthesizing Timed Automata With Minimal Numbers of Clocks From Optimised Timed Scenarios. Lecture notes in computer science (2024)

computer sciencesystems engineeringtimed automatatemporal logicdesign automationminimal numbersformal verificationtimed scenariostheory of computationtimed systemautomaton operationverificationformal methods

Operations on Timed Scenarios. Lecture notes in computer science (2023)

computer sciencesystems engineeringoperation managementoperations researchscheduling analysistemporal logicsystem sciencesystems modelingtimed scenariosformal verificationapproximate reasoningautomated reasoningtimed systemformal methods

An Efficient Customized Clock Allocation Algorithm for a Class of Timed Automata. Lecture notes in computer science (2022)

computer sciencetimed automataautomaton networkreal-time system designcomputer engineeringtheoretical computer scienceformal verificationtheory of computationtimed systemautomaton operationlogical automatonformal methods

Untangling the Graphs of Timed Automata to Decrease the Number of Clocks. Lecture notes in computer science (2022)

computer sciencetimed automatagraph theoryautomaton networkcombinatorial theorymathematicsdiscrete algorithmstheoretical computer sciencetree automatontheory of computationtimed systemautomaton operationapplied mathematicsformal methods

Minimization of the Number of Clocks for Timed Scenarios. Lecture notes in computer science (2021)

mathematical optimizationcomputer sciencesystems engineeringoperations researchtiming analysiscomputational complexitydiscrete algorithmstimed scenarioscomputational optimizationclock synchronizationtimed systemformal methods

Optimization of Timed Scenarios. Lecture notes in computer science (2020)

mathematical optimizationcomputer sciencesystems engineeringoperations researchcombinatorial optimizationtimed scenarioscomputational optimizationscheduling analysistimed systemscheduling problems

Synthesizing Clock-Efficient Timed Automata. Lecture notes in computer science (2020)

computer scienceprogramming languagesclock-efficient timed automatadesign automationcomputer engineeringtheoretical computer scienceformal verificationcomputer architecturetheory of computationtimed systemautomaton operationformal methods

Clock Allocation in Timed Automata and Graph Colouring. (2018)

computer sciencegraph theoryclock allocationautomaton networkdesign automationdiscrete algorithmstheoretical computer sciencetheory of computationtimed systemautomaton operation

1
2
3
10 / page

Neda Saeedloei

Assistant Professor

Towson University

Affiliations

Jess & Mildred Fisher College of Science & Mathematics

Department of Computer & Information Sciences

Neda Saeedloei is currently serving as a Computer & Information Sciences Assistant Professor at Towson University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Neda Saeedloei

Towson University

Assistant Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Generating Timed Scenarios From Behaviours. Studies in computational intelligence (2024)

systems engineeringtemporal logicsystem sciencesystems modelingformal verificationtimed scenariostimed systemformal methods

On the Existence of Unions of Timed Scenarios. Lecture notes in computer science (2024)

temporal logicset theorysystem sciencemathematicstimed scenariostimed system

Synthesizing Timed Automata With Minimal Numbers of Clocks From Optimised Timed Scenarios. Lecture notes in computer science (2024)

Operations on Timed Scenarios. Lecture notes in computer science (2023)

An Efficient Customized Clock Allocation Algorithm for a Class of Timed Automata. Lecture notes in computer science (2022)

Untangling the Graphs of Timed Automata to Decrease the Number of Clocks. Lecture notes in computer science (2022)

Minimization of the Number of Clocks for Timed Scenarios. Lecture notes in computer science (2021)

Optimization of Timed Scenarios. Lecture notes in computer science (2020)

mathematical optimizationcomputer sciencesystems engineeringoperations researchcombinatorial optimizationtimed scenarioscomputational optimizationscheduling analysistimed systemscheduling problems

Synthesizing Clock-Efficient Timed Automata. Lecture notes in computer science (2020)

Clock Allocation in Timed Automata and Graph Colouring. (2018)

computer sciencegraph theoryclock allocationautomaton networkdesign automationdiscrete algorithmstheoretical computer sciencetheory of computationtimed systemautomaton operation

1
2
3
10 / page