发布求助
文献互助 智能选刊 最新文献

Fundamenta Informaticae最新文献

筛选
英文 中文
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems 时间延迟双仿真是时间跃迁系统的等价关系
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2009-01-01 DOI: 10.5555/1576070.1576080
GribovskayaNatalya, VirbitskaiteIrina
{"title":"Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems","authors":"GribovskayaNatalya, VirbitskaiteIrina","doi":"10.5555/1576070.1576080","DOIUrl":"https://doi.org/10.5555/1576070.1576080","url":null,"abstract":"Timed transition systems are a widely studied model for real-time systems. The intention of the paper is to show the applicability of the general categorical framework of openmaps in order to prove...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71119664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automorphissm Classification of Cellular Automata 细胞自动机的自同构分类
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2009-01-01 DOI: 10.3233/FI-2010-339
H. Nishio
{"title":"Automorphissm Classification of Cellular Automata","authors":"H. Nishio","doi":"10.3233/FI-2010-339","DOIUrl":"https://doi.org/10.3233/FI-2010-339","url":null,"abstract":"A new classification of arbitrary cellular automata (CA for short) in Z d is studied considering the set (group) of all permutations of the neighborhood ν and state set Q. Two CA (Z d, Q, f A, ν A) and (Z d, Q, f B, ν B) are called automorphisc, if there is a pair of permutations (π, p) of ν and Q, respectively, such that (f B, ν B) = (p −1 f A πp, ν A π), where ν π denotes a permutation of ν and f π denotes a permutation of arguments of local function f corresponding to ν π. This automorphissm naturally induces a classification of CA, such that it generally preserves the global properties of CA up to permutation. As a typical example of the theory, the local functions of 256 ECA (1-dimensional 3-nearest neighbors 2-states CA) are classified into 46 classes. We also give a computer test of surjectivity, injecitivity and reversibility of the classes.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"12 1","pages":"195-208"},"PeriodicalIF":0.8,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74238494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Nets with Tokens which Carry Data 带有携带数据的令牌的网络
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2008-12-15 DOI: 10.1007/978-3-540-73094-1_19
R. Lazic, T. Newcomb, J. Ouaknine, A. W. Roscoe, J. Worrell
{"title":"Nets with Tokens which Carry Data","authors":"R. Lazic, T. Newcomb, J. Ouaknine, A. W. Roscoe, J. Worrell","doi":"10.1007/978-3-540-73094-1_19","DOIUrl":"https://doi.org/10.1007/978-3-540-73094-1_19","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"11 1","pages":"301-320"},"PeriodicalIF":0.8,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75849505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 126
Normal Form Nested Programs 格式嵌套程序
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2008-09-28 DOI: 10.3233/FI-2009-179
Annamaria Bria, Wolfgang Faber, N. Leone
{"title":"Normal Form Nested Programs","authors":"Annamaria Bria, Wolfgang Faber, N. Leone","doi":"10.3233/FI-2009-179","DOIUrl":"https://doi.org/10.3233/FI-2009-179","url":null,"abstract":"Disjunctive logic programming under the answer set semantics (DLP, ASP) has been acknowledged as a versatile formalism for knowledge representation and reasoning during the last decade. Lifschitz, Tang, and Turner have introduced an extended language of DLP, called Nested Logic Programming (NLP), in 1999 [1]. It often allows for more concise representations by permitting a richer syntax in rule heads and bodies. However, that language is propositional and thus does not allow for variables, one of the strengths of DLP. \u0000 \u0000In this paper, we introduce a language similar to NLP, called Normal Form Nested (NPN) programs, which does allow for variables, and present the syntax and semantics. With the presence of variables, domain independence is no longer guaranteed. We study this issue in depth and define the class of safe NPNprograms, which are guaranteed to be domain independent. Moreover, we show that for NPNprograms which are also NLPs, our semantics coincides with the one of [1]; while keeping the standard meaning of answer sets on DLP programs with variables. Finally, we provide an algorithm which translates NPNprograms into DLPprograms, and does so in an efficient way, allowing for the effective implementation of the NPNlanguage on top of existing DLP systems.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"36 1","pages":"76-88"},"PeriodicalIF":0.8,"publicationDate":"2008-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81393310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Synthesis of Elementary Net Systems with Context Arcs and Localities 具有上下文弧和局部的初等网络系统的综合
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2008-08-01 DOI: 10.1007/978-3-540-73094-1_18
M. Koutny, Marta Pietkiewicz-Koutny
{"title":"Synthesis of Elementary Net Systems with Context Arcs and Localities","authors":"M. Koutny, Marta Pietkiewicz-Koutny","doi":"10.1007/978-3-540-73094-1_18","DOIUrl":"https://doi.org/10.1007/978-3-540-73094-1_18","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"469 1","pages":"281-300"},"PeriodicalIF":0.8,"publicationDate":"2008-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90252598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
On Descriptional Complexity of Partially Parallel Grammars 部分并行语法的描述复杂性研究
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2008-08-01 DOI: 10.5555/1494710.1494720
MasopustTomáš, MedunaAlexander
{"title":"On Descriptional Complexity of Partially Parallel Grammars","authors":"MasopustTomáš, MedunaAlexander","doi":"10.5555/1494710.1494720","DOIUrl":"https://doi.org/10.5555/1494710.1494720","url":null,"abstract":"This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2008-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71118347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DIBOSON PHYSICS AT CDF CDF的Diboson物理
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2008-07-01 DOI: 10.1142/9789814280945_0043
T. Phillips
{"title":"DIBOSON PHYSICS AT CDF","authors":"T. Phillips","doi":"10.1142/9789814280945_0043","DOIUrl":"https://doi.org/10.1142/9789814280945_0043","url":null,"abstract":"We have studied diboson events produced by p{bar p} collisions at {radical}s = 1.96 TeV using the CDF detector. Our observations of Z{gamma}, WZ, and ZZ production are consistent with Standard Model predictions, and we set limits on some anomalous couplings.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":"323-327"},"PeriodicalIF":0.8,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64060463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Synthesis of Nets with Step Firing Policies 具有步进射击策略的网的合成
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2008-06-23 DOI: 10.3233/FI-2009-132
P. Darondeau, M. Koutny, Marta Pietkiewicz-Koutny, A. Yakovlev
{"title":"Synthesis of Nets with Step Firing Policies","authors":"P. Darondeau, M. Koutny, Marta Pietkiewicz-Koutny, A. Yakovlev","doi":"10.3233/FI-2009-132","DOIUrl":"https://doi.org/10.3233/FI-2009-132","url":null,"abstract":"The unconstrained step semantics of Petri nets is impractical for simulating and modelling applications. In the past, this inadequacy has been alleviated by introducing various flavours of maximally concurrent semantics, as well as priority orders. In this paper, we introduce a general way of controlling step semantics of Petri nets through step firing policies that restrict the concurrent behaviour of Petri nets and so improve their execution and modelling features. In a nutshell, a step firing policy disables at each marking a subset of enabled steps which could otherwise be executed. We discuss various examples of step firing policies and then investigate the synthesis problem for Petri nets controlled by such policies. Using generalised regions of step transition systems, we provide an axiomatic characterisation of those transition systems which can be realised as reachability graphs of Petri nets controlled by a given step firing policy. We also provide a decision and synthesis algorithm for PT-nets and step firing policies based on linear rewards of steps, where fixing the reward of elementary transitions is part of the synthesis problem. The simplicity of the algorithm supports our claim that the proposed approach is practical.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"52 1","pages":"112-131"},"PeriodicalIF":0.8,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81052126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
Measurement of the Open Charm Cross-Section in 200-GeV Heavy-Ion Collisions at STAR STAR上200-GeV重离子碰撞开粲截面的测量
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2008-05-27 DOI: 10.1142/9789814280945_0009
S. Baumgart, F. C. Collaboration
{"title":"Measurement of the Open Charm Cross-Section in 200-GeV Heavy-Ion Collisions at STAR","authors":"S. Baumgart, F. C. Collaboration","doi":"10.1142/9789814280945_0009","DOIUrl":"https://doi.org/10.1142/9789814280945_0009","url":null,"abstract":"We report on measurements of open charm production through both hadronic and semi-leptonic decay channels in $sqrt{s_{NN}}$ = 200 GeV heavy ion collision at the STAR experiment at RHIC. We compare experimental results to theoretical predictions from pQCD. The open charm $R_{AA}$ is also presented as evidence of possible medium-induced energy loss.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":"154-158"},"PeriodicalIF":0.8,"publicationDate":"2008-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64060378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
RESULTS FROM Υ(5S) AT BELLE: STRANGE BEAUTY AND OTHER BEASTS 结果从Υ(5秒)在美女:奇怪的美女和其他野兽
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2008-05-26 DOI: 10.1142/9789814280945_0034
K. Kinoshita
{"title":"RESULTS FROM Υ(5S) AT BELLE: STRANGE BEAUTY AND OTHER BEASTS","authors":"K. Kinoshita","doi":"10.1142/9789814280945_0034","DOIUrl":"https://doi.org/10.1142/9789814280945_0034","url":null,"abstract":"The Belle experiment collected in 2005-6 a total of 23.6 fb 1 of data at the �(10860) resonance, also known as �(5S). These constitute nearly all of the world’s sample of e + e → �(10860) events, which provide clean Bs pairs. We present here several Bs and �(10860) properties recently extracted from these data.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":"278-282"},"PeriodicalIF":0.8,"publicationDate":"2008-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64060269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信