You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Fundamenta Informaticae - Volume 186, issue 1-4

Purchase individual online access for 1 year to this journal.

Price: EUR 410.00
ISSN 0169-2968 (P)
ISSN 1875-8681 (E)

Impact Factor 2024: 0.4

Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:


- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.

Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.

results per page

Resource Bisimilarity in Petri Nets is Decidable

Authors: Lomazova, Irina A. | Bashkin, Vladimir A. | Jančar, Petr

Article Type: Research Article

Abstract: Petri nets are a popular formalism for modeling and analyzing distributed systems. Tokens in Petri net models can represent the control flow state or resources produced/consumed by transition firings. We define a resource as a part (a submultiset) of Petri net markings and call two resources equivalent when replacing one of them with another in any marking does not change the observable Petri net behavior. We consider resource similarity and resource bisimilarity, two congruent restrictions of bisimulation equivalence on Petri net markings. Previously it was proved that resource similarity (the largest congruence included in bisimulation equivalence) is undecidable. Here we … Show more

Keywords: labeled Petri nets, bisimulation, congruence, decidability, resource bisimilarity

DOI: 10.3233/FI-222125

Citation: Fundamenta Informaticae, vol. 186, no. 1-4, pp. 175-194, 2022

Price: EUR 27.50

Morphisms and Minimisation of Weighted Automata

Authors: Lombardy, Sylvain | Sakarovitch, Jacques

Article Type: Research Article

Abstract: This paper studies the algorithms for the minimisation of weighted automata. It starts with the definition of morphisms — which generalises and unifies the notion of bisimulation to the whole class of weighted automata — and the unicity of a minimal quotient for every automaton, obtained by partition refinement. From a general scheme for the refinement of partitions, two strategies are considered for the computation of the minimal quotient: the Domain Split and the Predecesor Class Split algorithms. They correspond respectivly to the classical Moore and Hopcroft algorithms for the computation of the minimal quotient of … Show more

DOI: 10.3233/FI-222126

Citation: Fundamenta Informaticae, vol. 186, no. 1-4, pp. 195-218, 2022

Price: EUR 27.50

Boris (Boaz) Trakhtenbrot — The Beginning

Authors: Trakhtenbrot, Mark

Article Type: Research Article

DOI: 10.3233/FI-222127

Citation: Fundamenta Informaticae, vol. 186, no. 1-4, pp. 219-236, 2022

Price: EUR 27.50
Show more