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 11, issue 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.

Table of Contents

Article Type: Other

DOI: 10.3233/FI-1988-11401

Citation: Fundamenta Informaticae, vol. 11, no. 4, pp. i-vi, 1988

Get PDF

Editor’s Foreword

Authors: Trakhtenbrot, B.A.

Article Type: Editorial

DOI: 10.3233/FI-1988-11402

Citation: Fundamenta Informaticae, vol. 11, no. 4, pp. 327-329, 1988

Get PDF

Compositional Semantics of Pure Place/Transition Systems

Authors: Mazurkiewicz, Antoni

Article Type: Research Article

Abstract: The notion of synchronization of qualified pomsets (pomsets equipped with an alphabet) is introduced and some properties of this operation are given. It is claimed that the synchronization operation is a sufficient tool for composing complex concurrent systems from a set of simple atomic ones. As an example the behaviour of pure place/transition Petri nets is defined by means of qualified pomset synchronization.

Keywords: Compositionality, modularity, concurrency, pomsets, algebras, Petri nets, semantics

DOI: 10.3233/FI-1988-11403

Citation: Fundamenta Informaticae, vol. 11, no. 4, pp. 331-355, 1988

Price: EUR 27.50

Behavior Structures and Nets

Authors: Rabinovich, A. | Trakhtenbrot, B.A.

Article Type: Research Article

Abstract: Behavior Structures integrate causality and branching. Nets of Behavior Structures provide a unifying approach to different net models of Concurrency. The Theory is illustrated wrt Nets over automata in particular wrt Petri Nets.

DOI: 10.3233/FI-1988-11404

Citation: Fundamenta Informaticae, vol. 11, no. 4, pp. 357-403, 1988

Price: EUR 27.50

Event Structure Representation of the Behaviour of Place/Transition Systems

Authors: Winkowski, Józef

Article Type: Research Article

Abstract: It is shown how the nonsequential behaviour of marked Petri nets of places and transitions can be described with the aid of mathematical systems related to labelled event structures. The method of description is modular in the sense that the global behaviour is obtained by combining local ones corresponding lo places and transitions.

Keywords: Place/Transition system, Petri net, marking, execution of transition, independence of executions, behaviour, configuration of events, labelled event structure, configuration system

DOI: 10.3233/FI-1988-11405

Citation: Fundamenta Informaticae, vol. 11, no. 4, pp. 405-432, 1988

Price: EUR 27.50

A Non-Interleaving Semantics for CCS Based on Proved Transitions

Authors: Boudol, Gérard | Castellani, Ilaria

Article Type: Research Article

Abstract: When using labelled transition systems to model languages like CCS or TCSP, one specifies transitions by a set of structural rules. We consider labelling transitions with their proofs – in the given system of rules – instead of simple actions. Then the label of a transition identifies uniquely that transition, and one may use this information to define a concurrency relation on (proved) transitions, and a notion of residual of a (proved) transition by a concurrent one. We apply Berry and Lévy’s notion of equivalence by permutations to sequences of proved transitions for CCS to obtain a partial order semantics … Show more

DOI: 10.3233/FI-1988-11406

Citation: Fundamenta Informaticae, vol. 11, no. 4, pp. 433-452, 1988

Price: EUR 27.50
Show more