期刊： ACTA INFORMATICA, 2020; 57 (3-5)
We review the grammatical inference problem for regular languages which aims to generate a deterministic finite automaton from a representative set of......
期刊： ACTA INFORMATICA, 2020; 57 (3-5)
Open pNets are formal models that can express the behaviour of open systems, either synchronous, asynchronous, or heterogeneous. They are endowed with......
期刊： ACTA INFORMATICA, 2020; 57 (3-5)
In this paper we look at one of the seminal works of Rob van Glabbeek from a probabilistic angle. We develop the bisimulation spectrum with silent mov......
期刊： ACTA INFORMATICA, 2019; 56 (6)
Tight security proofs allow for shorter security parameters and better efficiency. In this paper, we firstly present a new signature scheme, SSSTR, wh......
期刊： ACTA INFORMATICA, 2018; 55 (6)
Weak distribution bisimilarity is an equivalence notion on probabilistic automata, originally proposed for Markov automata. It has gained some popular......
期刊： ACTA INFORMATICA, 2018; 55 (7)
In this paper, we analyze an M/M/1 queue with batch arrival and multiple working vacations. We describe the queueing model by a special GI/M/1 type Ma......
期刊： ACTA INFORMATICA, 2018; 55 (5)
It is always an interesting subject to investigate whether a three-element language is a code or not. In this paper, we consider a special class of th......
期刊： ACTA INFORMATICA, 2018; 55 (8)
TSO-to-TSO linearizability is a variant of linearizability for concurrent libraries on the total store order (TSO) memory model. It is proved in this ......
期刊： ACTA INFORMATICA, 2017; 54 (5)
Attribute-based signature (ABS) is a novel cryptographic primitive, which can make the signing party sign a message with fine-grained control over ide......
