Acta Informatica

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
Acta Informatica - Tập 33 - Trang 595-606 - 1996
M. R. K. Krishna Rao
Innermost-confluence is important in giving call-by-value and denotational semantics and outermost-confluence is important in giving call-by-need and lazy semantics of programs. In this paper, we give a few sets of sufficient conditions under which the properties of confluence, innermost-confluence and outermost-confluence coincide. Confluence and innermost-confluence coincide for weakly innermost...... hiện toàn bộ
Net-based control versus rational control The relation between ITNC vector languages and rational relations
Acta Informatica - Tập 34 - Trang 23-57 - 1997
N. W. Keesmaat, H. C. M. Kleijn
An Individual Token Net Controller (or ITNC) is a particular type of state-machine decomposable Petri net that can be used as a synchronization mechanism in concurrent systems consisting of a fixed number of sequential subsystems. In this paper the family of ITNC vector languages is compared to the well-known family of rational relations. On the one hand it is proved that the family of rational r...... hiện toàn bộ
Analysis of dual-hop and multiple relays cooperative truncated ARQ with relay selection in WSNs
Acta Informatica - Tập 53 Số 1 - Trang 1-22 - 2016
Li, Suoping, Zhou, Yongqiang, Peng, Duo, Dou, Zufang, Zhou, Yong
The dual-hop truncated ARQ (DHT-ARQ) and multiple relays cooperative truncated ARQ (MRCT-ARQ) with relay selection in wireless sensor networks are analytically analyzed in this paper. A three-state discrete time Markov chain method is proposed, which is then used to derive the steady state distribution and throughput expressions. Furthermore, the number of retransmission of the two protocols is tr...... hiện toàn bộ
A model of a time sharing virtual memory system solved using equivalence and decomposition methods
Acta Informatica - Tập 4 - Trang 11-47 - 1974
A. Brandwajn
A queueing network model of a time-sharing multiprogramming virtual memory system is presented including the effect of memory sharing among processes. An approximate explicit solution is obtained using equivalence and decomposition methods. The influence of system and program behaviour parameters on system performance (mean response time and CPU utilization) is illustrated in the results obtained....... hiện toàn bộ
Variance of storage requirements for B+-trees
Acta Informatica - - 1995
W. W. Peterson
Minimally adequate teacher synthesizes statechart diagrams
Acta Informatica - Tập 38 - Trang 235-259 - 2002
Erkki Mäkinen, Tarja Systä
We consider the problem of synthesizing UML statechart diagrams from sequence diagrams as a language inference problem, and we solve it in Angluin's framework of minimally adequate teacher. The designer has the role of the teacher who answers membership and equivalence queries made by the algorithm. It turns out that there are several natural methods to decrease the number of membership queries n...... hiện toàn bộ
Deterministic sequential functions
Acta Informatica - Tập 29 - Trang 545-554 - 1992
T. Harju, H. C. M. Kleijn, M. Latteux
The simple rational partial functions accepted by generalized sequential machines are shown to coincide with the compositions ℋ ℋ −1 ℋ, where ℋ P consists of the prefix codings. The rational functions accepted by generalized sequential machines are proved to coincide wit...... hiện toàn bộ
Specification and verification of object-oriented programs using supertype abstraction
Acta Informatica - Tập 32 - Trang 705-778 - 1995
Gary T. Leavens, William E. Weihl
We present a formal specification language and a formal verification logic for a simple object-oriented programming language. The language is applicative and statically typed, and supports subtyping and message-passing. The verification logic relies on a behavioral notion of subtyping that captures the intuition that a subtype behaves like its supertypes. We give a formal definition for legal subt...... hiện toàn bộ
Computation sequences: A way to characterize classes of attribute grammars
Acta Informatica - Tập 19 - Trang 255-268
Hanne Riis Nielson
A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of wellknown subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered.
Querying sequence databases with transducers
Acta Informatica - Tập 36 - Trang 511-544 - 2000
Anthony J. Bonner, Giansalvatore Mecca
This paper develops a database query language called Transducer Datalog motivated by the needs of a new and emerging class of database applications. In these applications, such as text databases and genome databases, the storage and manipulation of long character sequences is a crucial feature. The issues involved in managing this kind of data are not addressed by traditional database systems, ei...... hiện toàn bộ
Tổng số: 1,156   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10