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

CoRR最新文献

筛选
英文 中文
Executions in (Semi-)Integer Petri Nets are Compact Closed Categories (半)整数Petri网中的执行是紧致闭类
CoRR Pub Date : 2018-05-15 DOI: 10.4204/EPTCS.287.7
F. Genovese, Jelle Herold
{"title":"Executions in (Semi-)Integer Petri Nets are Compact Closed Categories","authors":"F. Genovese, Jelle Herold","doi":"10.4204/EPTCS.287.7","DOIUrl":"https://doi.org/10.4204/EPTCS.287.7","url":null,"abstract":"In this work, we analyse Petri nets where places are allowed to have a negative number of tokens. For each net we build its correspondent category of executions, which is compact closed, and prove that this procedure is functorial. We moreover exhibit that a procedure to recover the original net from its category of executions exists, that it is again functorial, and that this gives rise to an adjoint pair. Finally, we use compact closeness to infer that allowing negative tokens in a Petri net makes the causal relations between transition firings non-trivial, and we use this to model interesting phenomena in economics and computer science.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"36 1","pages":"127-144"},"PeriodicalIF":0.0,"publicationDate":"2018-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87997766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Proceedings Joint Workshop on Handling IMPlicit and EXplicit knowledge in formal system development (IMPEX) and Formal and Model-Driven Techniques for Developing Trustworthy Systems (FM&MDD), IMPEX/FM&MDD 2017, Xi'an, China, 16th November 2017 正式系统开发(IMPEX)中隐式和显式知识处理与可信赖系统开发(FM&MDD)的正式和模型驱动技术联合研讨会，IMPEX/FM&MDD 2017，中国西安，2017年11月16日
CoRR Pub Date : 2018-05-12 DOI: 10.4204/EPTCS.271
Régine Laleau, D. Méry, S. Nakajima, E. Troubitsyna
{"title":"Proceedings Joint Workshop on Handling IMPlicit and EXplicit knowledge in formal system development (IMPEX) and Formal and Model-Driven Techniques for Developing Trustworthy Systems (FM&MDD), IMPEX/FM&MDD 2017, Xi'an, China, 16th November 2017","authors":"Régine Laleau, D. Méry, S. Nakajima, E. Troubitsyna","doi":"10.4204/EPTCS.271","DOIUrl":"https://doi.org/10.4204/EPTCS.271","url":null,"abstract":"This volume contains the joint proceedings of IMPEX 2017, the first workshop on Handling IMPlicit and EXplicit knowledge in formal system development and FM&MDD, the second workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems (FM&MDD) held together on November 16, 2017 in Xi'an, China, as part of ICFEM 2017, 19th International Conference on Formal Engineering Methods. \u0000IMPEX emphasises mechanisms for reducing heterogeneity of models induced by the absence of explicit semantics expression in the formal techniques used to specify these models. More precisely, the meeting targets to highlight the advances in handling both implicit and explicit semantics in formal system developments. \u0000The aims of FM&MDD are to advance the understanding in the area of developing and applying formal and model-driven techniques for designing trustworthy systems, to discuss the emerging issues in the area, to improve the dialog between different research communities and between academia and industry, to discuss a roadmap of the future research in the area and to create a forum for discussing and disseminating the new ideas and the research results in the area","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"125 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74685114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Vector Programming Using Structural Recursion 使用结构递归的向量编程
CoRR Pub Date : 2018-05-11 DOI: 10.4204/EPTCS.270.1
M. Morazán
{"title":"Vector Programming Using Structural Recursion","authors":"M. Morazán","doi":"10.4204/EPTCS.270.1","DOIUrl":"https://doi.org/10.4204/EPTCS.270.1","url":null,"abstract":"Vector programming is an important topic in many Introduction to Computer Science courses. Despite the importance of vectors, learning vector programming is a source for frustration to many students given that they feel left adrift when it comes to resolving vector indexing errors. Even though the size of a vector is a natural number, there have been no efforts to define a useful recursive data definition to help beginners design vector processing functions. This article defines the concept of a vector interval and describes how to exploit its recursive structure to design vector processing functions. The described methodology provides a context beginners can use to reason about proper vector indexing instead of leaving them adrift with this responsibility. A key feature of properly using the described methodology is that if students process the correct vector interval then vector indexing errors can not arise. The classroom deployment of this approach is described in detail. Students, to date, have found vector intervals helpful in avoiding out-of-bounds indexing errors when all the vector elements of the interval are processed.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"85 1","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2018-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83920200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Using Elm to Introduce Algebraic Thinking to K-8 Students 用榆树向K-8学生介绍代数思维
CoRR Pub Date : 2018-05-11 DOI: 10.4204/EPTCS.270.2
Curtis D'Alves, Tanya Bouman, Christopher W. Schankula, J. Hogg, Levin Noronha, Emily Horsman, R. Siddiqui, Christopher Kumar Anand
{"title":"Using Elm to Introduce Algebraic Thinking to K-8 Students","authors":"Curtis D'Alves, Tanya Bouman, Christopher W. Schankula, J. Hogg, Levin Noronha, Emily Horsman, R. Siddiqui, Christopher Kumar Anand","doi":"10.4204/EPTCS.270.2","DOIUrl":"https://doi.org/10.4204/EPTCS.270.2","url":null,"abstract":"In recent years, there has been increasing interest in developing a Computer Science curriculum for K-8 students. However, there have been significant barriers to creating and deploying a Computer Science curriculum in many areas, including teacher time and the prioritization of other 21st-century skills. At McMaster University, we have developed both general computer literacy activities and specific programming activities. Integration of these activities is made easy as they each support existing curricular goals. In this paper, we focus on programming in the functional language Elm and the graphics library GraphicSVG. Elm is in the ML (Meta Language) family, with a lean syntax and easy inclusion of Domain Specific Languages. This allows children to start experimenting with GraphicSVG as a language for describing shape, and pick up the core Elm language as they grow in sophistication. Teachers see children making connections between computer graphics and mathematics within the first hour. Graphics are defined declaratively, and support aggregation and transformation, i.e., Algebra. Variables are not needed initially, but are introduced as a time-saving feature, which is immediately accepted. Since variables are declarative, they match students' expectations. Advanced students are also exposed to State by making programs that react to user taps or clicks. The syntax required to do so closely follows the theoretical concepts, making it easy for them to grasp. For each of these concepts, we explain how they fit into the presentations we make to students, like the 5200 children taught in 2016. \u0000Finally, we describe ongoing work on a touch-based Elm editor for iPad, which features (1) type highlighting (as opposed to syntax highlighting), (2) preservation of correct syntax and typing across transformations, (3) context information (e.g. displaying parameter names for GraphicSVG functions), and (4) immediate feedback (e.g. restarting animations after every program change).","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"16 1","pages":"18-36"},"PeriodicalIF":0.0,"publicationDate":"2018-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82550350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Teaching Erlang through the Internet: An Experience Report 通过互联网进行Erlang教学:经验报告
CoRR Pub Date : 2018-05-11 DOI: 10.4204/EPTCS.270.4
Stephen Adams
{"title":"Teaching Erlang through the Internet: An Experience Report","authors":"Stephen Adams","doi":"10.4204/EPTCS.270.4","DOIUrl":"https://doi.org/10.4204/EPTCS.270.4","url":null,"abstract":"Today functional programming languages are seen as a practical solution to the difficult problems of concurrent and distributed programming. Erlang is a functional language designed to build massively scalable and fault tolerant applications. This paper describes the authors' experiences delivering a massively online open course (MOOC) on the FutureLearn platform.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"6 1","pages":"52-60"},"PeriodicalIF":0.0,"publicationDate":"2018-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76585764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The category TOF TOF类别
CoRR Pub Date : 2018-04-27 DOI: 10.4204/EPTCS.287.4
J. Cockett, Cole Comfort
{"title":"The category TOF","authors":"J. Cockett, Cole Comfort","doi":"10.4204/EPTCS.287.4","DOIUrl":"https://doi.org/10.4204/EPTCS.287.4","url":null,"abstract":"We provide a complete set of identities for the symmetric monoidal category, TOF, generated by the Toffoli gate and computational ancillary bits. We do so by demonstrating that the functor which evaluates circuits on total points, is an equivalence into the full subcategory of sets and partial isomorphisms with objects finite powers of the two element set. The structure of the proof builds -- and follows the proof of Cockett et al.-- which provided a full set of identities for the cnot gate with computational ancillary bits. Thus, first it is shown that TOF is a discrete inverse category in which all of the identities for the cnot gate hold; and then a normal form for the restriction idempotents is constructed which corresponds precisely to subobjects of the total points of TOF. This is then used to show that TOF is equivalent to FPinj2, the full subcategory of sets and partial isomorphisms in which objects have cardinality a power of 2.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"48 1","pages":"67-84"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75319406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Backward induction for repeated games 重复游戏的逆向归纳
CoRR Pub Date : 2018-04-19 DOI: 10.4204/EPTCS.275.5
Jules Hedges
{"title":"Backward induction for repeated games","authors":"Jules Hedges","doi":"10.4204/EPTCS.275.5","DOIUrl":"https://doi.org/10.4204/EPTCS.275.5","url":null,"abstract":"We present a method of backward induction for computing approximate subgame perfect Nash equilibria of infinitely repeated games with discounted payoffs. This uses the selection monad transformer, combined with the searchable set monad viewed as a notion of 'topologically compact' nondeterminism, and a simple model of computable real numbers. This is the first application of Escard'o and Oliva's theory of higher-order sequential games to games of imperfect information, in which (as well as its mathematical elegance) lazy evaluation does nontrivial work for us compared with a traditional game-theoretic analysis. Since a full theoretical understanding of this method is lacking (and appears to be very hard), we consider this an 'experimental' paper heavily inspired by theoretical ideas. We use the famous Iterated Prisoner's Dilemma as a worked example.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"27 1","pages":"35-52"},"PeriodicalIF":0.0,"publicationDate":"2018-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86401745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Proceedings 2nd International Workshop on Safe Control of Autonomous Vehicles, SCAV@CPSWeek 2018, Porto, Portugal, 10th April 2018 第二届自动驾驶汽车安全控制国际研讨会论文集，SCAV@CPSWeek 2018，葡萄牙波尔图，2018年4月10日
CoRR Pub Date : 2018-04-10 DOI: 10.4204/EPTCS.269
Mario Gleirscher, Stefan Kugele, Sven Linker
{"title":"Proceedings 2nd International Workshop on Safe Control of Autonomous Vehicles, SCAV@CPSWeek 2018, Porto, Portugal, 10th April 2018","authors":"Mario Gleirscher, Stefan Kugele, Sven Linker","doi":"10.4204/EPTCS.269","DOIUrl":"https://doi.org/10.4204/EPTCS.269","url":null,"abstract":"These are the proceedings of the Second International Workshop on Safe Control of Autonomous Vehicles, which took place on the 10th of April 2018 in Porto, Portugal as an affiliated workshop of CSPWeek. The task of this workshop is to identify open research problems, discuss recent achievements, bring together researchers in, e.g., control theory, adaptive systems, machine self-organization and autonomy, mobile intelligent robotics, transportation, traffic control, machine learning, software verification, and dependability and security engineering.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77117748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Introducing Liveness into Multi-lane Spatial Logic lane change controllers using UPPAAL 利用UPPAAL将动态引入多车道空间逻辑变道控制器
CoRR Pub Date : 2018-04-10 DOI: 10.4204/EPTCS.269.3
Maike Schwammberger
{"title":"Introducing Liveness into Multi-lane Spatial Logic lane change controllers using UPPAAL","authors":"Maike Schwammberger","doi":"10.4204/EPTCS.269.3","DOIUrl":"https://doi.org/10.4204/EPTCS.269.3","url":null,"abstract":"With Multi-lane Spatial Logic (MLSL) a powerful approach to formally reason about and prove safety of autonomous traffic manoeuvres was introduced. Extended timed automata controllers using MLSL were constructed to commit safe lane change manoeuvres on highways. However, the approach has only few implementation and verification results. We thus strenghen the MLSL approach by implementing their lane change controller in UPPAAL and confirming the safety of the lane change protocol. We also detect the unlive behaviour of the original controller and thus extend it to finally verify liveness of the new lane change controller.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"11 1","pages":"17-31"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82774138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Identification of Risk Significant Automotive Scenarios Under Hardware Failures 硬件故障下汽车重大风险场景识别
CoRR Pub Date : 2018-04-10 DOI: 10.4204/EPTCS.269.6
Mohammad Hejase, A. Kurt, T. Aldemir, Ü. Özgüner
{"title":"Identification of Risk Significant Automotive Scenarios Under Hardware Failures","authors":"Mohammad Hejase, A. Kurt, T. Aldemir, Ü. Özgüner","doi":"10.4204/EPTCS.269.6","DOIUrl":"https://doi.org/10.4204/EPTCS.269.6","url":null,"abstract":"The level of autonomous functions in vehicular control systems has been on a steady rise. This rise makes it more challenging for control system engineers to ensure a high level of safety, especially against unexpected failures such as stochastic hardware failures. A generic Backtracking Process Algorithm (BPA) based on a deductive implementation of the Markov/Cell-to-Cell Mapping technique is proposed for the identification of critical scenarios leading to the violation of safety goals. A discretized state-space representation of the system allows tracing of fault propagation throughout the system, and the quantification of probabilistic system evolution in time. A case study of a Hybrid State Control System for an autonomous vehicle prone to a brake-by-wire failure is constructed. The hazard of interest is collision with a stationary vehicle. The BPA is implemented to identify the risk significant scenarios leading to the hazard of interest.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"45 1","pages":"59-73"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89035602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信