What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Algebra
P. S. Thiagarajan spends much of his time researching Theoretical computer science, Concurrency, Artificial intelligence, Petri net and Algorithm.
His Theoretical computer science research integrates issues from Realizability, Bounded function and Message sequence chart.
His studies in Concurrency integrate themes in fields like Net and Algebra.
As part of his studies on Artificial intelligence, P. S. Thiagarajan frequently links adjacent subjects like Distributed computing.
His Process architecture study, which is part of a larger body of work in Petri net, is frequently linked to Synchronization, bridging the gap between disciplines.
His work deals with themes such as Well-formed formula, Propositional variable, Intermediate logic and Systems analysis, which intersect with Algorithm.
His most cited work include:
- OpenComet: an automated tool for comet assay image analysis. (300 citations)
- Elements of General Net Theory (166 citations)
- Message sequence charts (165 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Theoretical computer science, Concurrency, Petri net, Temporal logic and Algorithm.
His Theoretical computer science research is multidisciplinary, relying on both Finite-state machine, Probabilistic logic and Class.
His research in Concurrency intersects with topics in Discrete mathematics, Transition system, Net, Algebra and Artificial intelligence.
His work in the fields of Discrete mathematics, such as Conjecture, overlaps with other areas such as Event.
His Petri net study frequently draws connections to other fields, such as Event structure.
His Temporal logic research also works with subjects such as
- Dynamic logic and Multimodal logic most often made with reference to Linear temporal logic,
- Time complexity which intersects with area such as Decidability and Class.
He most often published in these fields:
- Theoretical computer science (39.29%)
- Concurrency (30.71%)
- Petri net (27.14%)
What were the highlights of his more recent work (between 2011-2021)?
- Markov chain (6.43%)
- Probabilistic logic (8.57%)
- Probability distribution (6.43%)
In recent papers he was focusing on the following fields of study:
Markov chain, Probabilistic logic, Probability distribution, Theoretical computer science and Ode are his primary areas of study.
He has researched Markov chain in several fields, including Interval and Finite set.
The study incorporates disciplines such as Time complexity, Dynamical systems theory and Concurrency in addition to Probabilistic logic.
His Concurrency research is multidisciplinary, incorporating perspectives in Event, Variety and New Foundations.
His Disjoint sets research extends to Theoretical computer science, which is thematically connected.
In his study, Discrete time and continuous time, Applied mathematics and Bounded function is inextricably linked to Hybrid system, which falls within the broad field of Probabilistic analysis of algorithms.
Between 2011 and 2021, his most popular works were:
- OpenComet: an automated tool for comet assay image analysis. (300 citations)
- Statistical Model Checking Based Calibration and Analysis of Bio-pathway Models (34 citations)
- Approximate probabilistic analysis of biopathway dynamics (24 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Algebra
P. S. Thiagarajan mainly focuses on Probability distribution, Theoretical computer science, Ode, Ordinary differential equation and Markov chain.
His work on Model checking as part of general Theoretical computer science study is frequently linked to Context, bridging the gap between disciplines.
His Model checking research incorporates elements of Time complexity, Probabilistic analysis of algorithms, Kernel and Temporal logic.
His Ode study integrates concerns from other disciplines, such as Estimation theory and Sensitivity.
The various areas that P. S. Thiagarajan examines in his Sensitivity study include Algorithm, Mathematical optimization and Formal specification.
His Markov chain study which covers Discrete mathematics that intersects with Matrix analytic method, Discrete phase-type distribution, Tuple, Set and Finite set.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
