His primary scientific interests are in Theoretical computer science, Algorithm, Probabilistic logic, Probabilistic CTL and Probability distribution. Roberto Segala frequently studies issues relating to Correctness and Theoretical computer science. His work deals with themes such as Hybrid automaton and Probabilistic analysis of algorithms, which intersect with Algorithm.
Roberto Segala usually deals with Hybrid automaton and limits it to topics linked to Discrete mathematics and Automaton. His work in Probabilistic logic covers topics such as Temporal logic which are related to areas like Model checking and Reachability. His biological study deals with issues like Probabilistic argumentation, which deal with fields such as Computation, Probabilistic relevance model and Divergence-from-randomness model.
Roberto Segala focuses on Theoretical computer science, Automaton, Probabilistic logic, Probabilistic automaton and Algorithm. Roberto Segala is interested in Nondeterministic algorithm, which is a branch of Theoretical computer science. His studies in Automaton integrate themes in fields like Discrete mathematics and Distributed computing.
In Probabilistic logic, Roberto Segala works on issues like Oblivious transfer, which are connected to Concrete security and Computer security model. His studies deal with areas such as Bisimulation, Computation and Algebra as well as Probabilistic automaton. Roberto Segala has researched Algorithm in several fields, including Probabilistic analysis of algorithms and Temporal logic.
His primary areas of investigation include Automaton, Theoretical computer science, Spacetime, Probabilistic automaton and Implicit communication. Many of his research projects under Automaton are closely connected to Local variable, Randomness and Space with Local variable, Randomness and Space, tying the diverse disciplines of science together. The concepts of his Theoretical computer science study are interwoven with issues in Object, Algorithm and Extension.
His work on Cryptographic protocol and Security parameter as part of general Algorithm research is often related to Cryptographic nonce, Event and Bounded function, thus linking different fields of science. His Probabilistic automaton research is included under the broader classification of Probabilistic logic. In general Probabilistic logic study, his work on Probabilistic CTL and Probabilistic argumentation often relates to the realm of Probabilistic database, thereby connecting several areas of interest.
Theoretical computer science, Automaton, Probabilistic automaton, Probabilistic argumentation and Bisimulation are his primary areas of study. His Theoretical computer science research incorporates elements of Range and Correctness. He combines subjects such as Distributed algorithm, Distributed computing and Reliability with his study of Automaton.
His Probabilistic automaton research is within the category of Probabilistic logic.
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.
Modeling and verification of randomized distributed real-time systems
Roberto Segala.
(1996)
Probabilistic simulations for probabilistic processes
Roberto Segala;Nancy Lynch.
Nordic Journal of Computing (1995)
Hybrid I/O automata
Nancy Lynch;Roberto Segala;Frits Vaandrager.
Information & Computation (2003)
Automatic verification of real-time systems with discrete probability distributions
Marta Kwiatkowska;Gethin Norman;Roberto Segala;Jeremy Sproston.
Theoretical Computer Science (2002)
Probabilistic Simulations for Probabilistic Processes
Roberto Segala;Nancy A. Lynch.
international conference on concurrency theory (1994)
Hybrid I/O automata
N. Lynch;R. Segala;F.W. Vaandrager;H.B. Weinberg.
International Hybrid Systems Workshop (1995)
The Theory of Timed I/O Automata
Dilsun Kirli Kaynar;Nancy A. Lynch;Roberto Segala;Frits W. Vaandrager.
(2006)
Hybrid I/O automata
Nancy Lynch;Roberto Segala;Frits Vaandrager;H. B. Weinberg.
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control (1996)
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
Luca de Alfaro;Marta Z. Kwiatkowska;Gethin Norman;David Parker.
tools and algorithms for construction and analysis of systems (2000)
Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems
D.K. Kaynar;N. Lynch;R. Segala;F. Vaandrager.
real-time systems symposium (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
MIT
Radboud University Nijmegen
University of Oxford
University of Glasgow
Boston University
Saarland University
University of Bologna
United States Naval Research Laboratory
Ben-Gurion University of the Negev
University of Oxford
French Institute for Research in Computer Science and Automation - INRIA
Publications: 36
University of California, Davis
University of California, Berkeley
Hebei University of Technology
Peking University
University of California, Santa Barbara
Italian Institute of Technology
University of Sheffield
University of Antwerp
UNAVCO
University of Tennessee at Knoxville
University of Padua
Brigham and Women's Hospital
University Health Network
Maastricht University
Queensland University of Technology
University of Manchester