Special Issue "Bisimulation and Simulation Algorithms"

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 July 2018)

Special Issue Editors

Guest Editor
Dr. Alberto Policriti

University of Udine, Via delle Scienze, 206, 33100 Udine UD, Italy
Website | E-Mail
Interests: bioinformatics; logic in computer science; computable set theory
Guest Editor
Dr. Carla Piazza

Department of Mathematics, Informatics, and Physics, University of Udine, Via delle Scienze, 206, 33100 Udine UD, Italy
Website | E-Mail
Interests: systems biology; hybrid automata; model checking; information flow security
Guest Editor
Dr. Raffaella Gentilini

Department of Mathematics and Computer Science, University of Perugia, 1 - 06121 Perugia, Perugia, Italy
Website | E-Mail
Interests: algorithm design; automata theory; logic and games with applications to the algorithmic verification of systems

Special Issue Information

Dear Colleague,

This Special Issue will survey the current state-of-the-art on algorithms for computing bisimulation and simulation in different fields.

Bisimulation and simulation have been pervasive in the areas of set theory, logics, category theory, formal languages, concurrency, automated verification, performances evaluation. The analysis techniques based on bisimulation and simulation developed in such areas have been successfully applied to the study of both engineered, natural, and hybrid systems. For instance, infinite state systems have been formally verified thanks to the computation of their finite bisimulation/simulation quotients. Since the beginning the need for efficient bisimulation and simulation algorithms has involved some of the most important names in algorithms.

We invite original high-quality contributions on all algorithmic aspects of bisimulation and simulation computation, including (but not limited to):

  • classical partitioning techniques
  • abstract interpretation based computations
  • symbolic techniques
  • variants of the problem such as stuttering, probabilistic, stochastic ones
  • lower bounds to the complexity
  • tools and applications
Dr. Alberto Policriti
Dr. Carla Piazza
Dr. Raffaella Gentilini
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 850 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • bisimulation
  • simulation
  • state space reduction
  • model checking
  • set theory
  • process algebras

Published Papers (1 paper)

View options order results:
result details:
Displaying articles 1-1
Export citation of selected articles as:

Research

Open AccessArticle An Efficient Algorithm to Determine Probabilistic Bisimulation
Algorithms 2018, 11(9), 131; https://doi.org/10.3390/a11090131
Received: 10 July 2018 / Revised: 20 August 2018 / Accepted: 27 August 2018 / Published: 3 September 2018
PDF Full-text (920 KB) | HTML Full-text | XML Full-text
Abstract
We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmic in the number of states, distinguishing both action states and
[...] Read more.
We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmic in the number of states, distinguishing both action states and probabilistic states, and the transitions between them. The algorithm improves upon the proposed complexity bounds of the best algorithm addressing the same purpose so far by Baier, Engelen and Majster-Cederbaum (Journal of Computer and System Sciences 60:187–231, 2000). In addition, experimentally, on various benchmarks, our algorithm performs rather well; even on relatively small transition systems, a performance gain of a factor 10,000 can be achieved. Full article
(This article belongs to the Special Issue Bisimulation and Simulation Algorithms)
Figures

Figure 1

Back to Top