2022 - Research.com Computer Science in Sweden Leader Award
Theoretical computer science, Finite-state machine, Model checking, Algorithm and Reachability are his primary areas of study. His Theoretical computer science study incorporates themes from Set and Concurrency. His Finite-state machine research is multidisciplinary, incorporating elements of Equivalence, Decidability and Conformance testing.
His Model checking research incorporates elements of Probabilistic automaton and Temporal logic. The Algorithm study combines topics in areas such as Regular expression and Lossy compression. His Reachability research integrates issues from Automaton and Petri net.
His primary areas of investigation include Theoretical computer science, Model checking, Programming language, Automaton and Algorithm. His Theoretical computer science study combines topics from a wide range of disciplines, such as Finite-state machine, Communications protocol, Semantic data model and Component. His Finite-state machine study deals with Decidability intersecting with State.
His Model checking research includes elements of Stateless protocol, Parameterized complexity, Temporal logic and Concurrency. His biological study spans a wide range of topics, including Discrete mathematics and Transitive closure. His work on Timed automaton, Regular language and Automata theory as part of general Automaton study is frequently linked to Data domain, therefore connecting diverse disciplines of science.
Bengt Jonsson mostly deals with Theoretical computer science, Model checking, Stateless protocol, Partial order reduction and Parallel computing. His Theoretical computer science study combines topics from a wide range of disciplines, such as Finite-state machine, Disjunctive normal form and Theory of computation. Bengt Jonsson studied Finite-state machine and Data flow diagram that intersect with Software development and Class.
His Model checking study is associated with Algorithm. His study on Stateless protocol also encompasses disciplines like
Bengt Jonsson focuses on Theoretical computer science, Model checking, Stateless protocol, POSIX Threads and Parallel computing. His research in Theoretical computer science is mostly focused on Formal verification. His research investigates the link between Stateless protocol and topics such as Memory model that cross with problems in Scheme, Execution model, Axiom and Abstraction model checking.
Bengt Jonsson works mostly in the field of POSIX Threads, limiting it down to topics relating to Partial order reduction and, in certain cases, Overhead, Concurrency, Computational model and Standard model, as a part of the same area of interest. Many of his research projects under Parallel computing are closely connected to Reuse with Reuse, tying the diverse disciplines of science together. His Finite-state machine research incorporates elements of Data flow diagram and Automaton.
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.
A logic for reasoning about time and reability
Hans Hansson;Bengt Jonsson.
Formal Aspects of Computing (1990)
Model-Based Testing of Reactive Systems, Advanced Lectures
Manfred Broy;Bengt Jonsson;Joost-Pieter Katoen;Martin Leucker.
Lecture Notes in Computer Science (2005)
General decidability theorems for infinite-state systems
P.A. Abdulla;K. Cerans;B. Jonsson;Yih-Kuen Tsay.
logic in computer science (1996)
Verifying programs with unreliable channels
P. Abdulla;B. Jonsson.
logic in computer science (1993)
Regular model checking
A. Bouajjani;B. Jonsson;M. Nilsson;T. Touili.
Lecture Notes in Computer Science (2000)
Specification and refinement of probabilistic processes
B. Jonsson;K.G. Larsen.
logic in computer science (1991)
A calculus for communicating systems with time and probabilities
H. Hansson;B. Jonsson.
real-time systems symposium (1990)
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
Parosh Aziz Abdulla;Kārlis Čerāns;Bengt Jonsson;Yih-Kuen Tsay.
Information & Computation (2000)
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
Parosh Aziz Abdulla;Ahmed Bouajjani;Bengt Jonsson.
computer aided verification (1998)
Probabilistic Extensions of Process Algebras
Bengt Jonsson;Kim Larsen;Wang Yi.
Handbook of Process Algebra (2001)
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: