Pub Date : 2007-01-12DOI: 10.7146/BRICS.V14I2.21925
L. Aceto, A. Ingólfsdóttir
This paper discusses the classic notion of characteristic formulae for processes using variations on Hennessy-Milner logic as the underlying logical specification language. It is shown how to characterize logically (states of) finite labelled transition systems modulo bisimilarity using a single formula in Hennessy-Milner logic with recursion. Moreover, characteristic formulae for timed automata with respect to timed bisimilarity and the faster-than preorder of Moller and Tofts are offered in terms of the logic L_nu of Laroussinie, Larsen and Weise.
{"title":"Characteristic Formulae: From Automata to Logic","authors":"L. Aceto, A. Ingólfsdóttir","doi":"10.7146/BRICS.V14I2.21925","DOIUrl":"https://doi.org/10.7146/BRICS.V14I2.21925","url":null,"abstract":"This paper discusses the classic notion of characteristic formulae for processes using variations on Hennessy-Milner logic as the underlying logical specification language. It is shown how to characterize logically (states of) finite labelled transition systems modulo bisimilarity using a single formula in Hennessy-Milner logic with recursion. Moreover, characteristic formulae for timed automata with respect to timed bisimilarity and the faster-than preorder of Moller and Tofts are offered in terms of the logic L_nu of Laroussinie, Larsen and Weise.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134155364","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}
Pub Date : 2004-04-01DOI: 10.1142/9789812562494_0042
H. Ehrig
{"title":"On the relevance of high-level net processes, Formal Specification Column","authors":"H. Ehrig","doi":"10.1142/9789812562494_0042","DOIUrl":"https://doi.org/10.1142/9789812562494_0042","url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129029469","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}
Pub Date : 2004-01-11DOI: 10.1007/978-3-540-24622-0_26
D. Harel
{"title":"A Grand Challenge for Computing: Towards Full Reactive Modeling of A Multi-Cellular Animal","authors":"D. Harel","doi":"10.1007/978-3-540-24622-0_26","DOIUrl":"https://doi.org/10.1007/978-3-540-24622-0_26","url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131805519","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}
Pub Date : 2003-08-25DOI: 10.1007/978-3-540-45138-9_2
Rainer Feldmann, M. Gairing, T. Lücking, B. Monien, Manuel Rode
{"title":"Selfish Routing in Non-Cooperative Networks: A Survey","authors":"Rainer Feldmann, M. Gairing, T. Lücking, B. Monien, Manuel Rode","doi":"10.1007/978-3-540-45138-9_2","DOIUrl":"https://doi.org/10.1007/978-3-540-45138-9_2","url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132412197","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}
Pub Date : 2003-05-08DOI: 10.1142/9789812562494_0024
P. Arrighi
There are many falsely intuitive introductions to quantum theory and quantum computation in a handwave. There are also numerous documents which teach those subjects in a mathematically sound manner. To my knowledge this paper is the shortest of the latter category. The aim is to deliver a short yet rigorous and self-contained introduction to Quantum Computation, whilst assuming the reader has no prior knowledge of anything but the fundamental operations on real numbers. Successively I introduce complex matrices; the postulates of quantum theory and the simplest quantum algorithm. The document originates from a fifty minutes talk addressed to a non-specialist audience, in which I sought to take the shortest mathematical path that proves a quantum algorithm right.
{"title":"Quantum Computation Explained to My Mother","authors":"P. Arrighi","doi":"10.1142/9789812562494_0024","DOIUrl":"https://doi.org/10.1142/9789812562494_0024","url":null,"abstract":"There are many falsely intuitive introductions to quantum theory and quantum computation in a handwave. There are also numerous documents which teach those subjects in a mathematically sound manner. To my knowledge this paper is the shortest of the latter category. The aim is to deliver a short yet rigorous and self-contained introduction to Quantum Computation, whilst assuming the reader has no prior knowledge of anything but the fundamental operations on real numbers. Successively I introduce complex matrices; the postulates of quantum theory and the simplest quantum algorithm. The document originates from a fifty minutes talk addressed to a non-specialist audience, in which I sought to take the shortest mathematical path that proves a quantum algorithm right.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124960625","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}
Pub Date : 2002-06-01DOI: 10.1142/9789812562494_0048
A. Blass, Y. Gurevich
In a recent paper, the logician Yiannis Moschovakis argues that no state machine describes mergesort on its natural level of abstraction. We do just that. Our state machine is a recursive ASM.
{"title":"Algorithms vs. Machines","authors":"A. Blass, Y. Gurevich","doi":"10.1142/9789812562494_0048","DOIUrl":"https://doi.org/10.1142/9789812562494_0048","url":null,"abstract":"In a recent paper, the logician Yiannis Moschovakis argues that no state machine describes mergesort on its natural level of abstraction. We do just that. Our state machine is a recursive ASM.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126332929","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}
Pub Date : 1999-01-24DOI: 10.7146/BRICS.V6I24.20093
L. Aceto, W. Fokkink, C. Verhoef
Structural operational semantics (SOS) [44] provides a framework to give an operational semantics to programming and specification languages. In particular, because of its intuitive appeal and flexibility, SOS has found considerable application in the study of the semantics of concurrent processes. SOS generates a labelled transition system, whose states are the closed terms over an algebraic signature, and whose transitions are supplied with labels. The transitions between states are obtained inductively from a transition system specification (TSS), which consists of so-called transition rules of the form premises / conclusion . A typical example of a transition rule is: ... stipulating that if t -> t' holds for closed terms t and t', then so does t||u -> t'||u for each closed term u. In general, validity (or invalidity) of the positive (or negative) premises of a transition rule, under a certain substitution implies validity of the conclusion of this rule under the same substitution. This column is an excerpt from [2], which gives an overview of recent results in the field of SOS, with an emphasis on existing formats for TSSs. Each of these formats comes equipped with a rich body of results that are guaranteed to hold for any process calculus whose TSS is within that format. Over and over again, process calculi such as CCS [40], CSP [47], and ACP [11] have been extended with new features, and the TSSs that provide the operational semantics for these process algebras were extended with transition rules to describe these features; see, e.g. [10] for a systematic approach. A question that arises naturally is whether or not the original and the extended TSS induce the same transitions t -> t' for closed terms t in the original domain. Usually it is desirable that an extension is operationally conservative, meaning that the provable transitions for an original term are the same both in the original and in the extended TSS. Groote and Vaandrager [34, Thm. 7.6] proposed syntactic restrictions on a TSS, which automatically yield that an extension of this TSS with transition rules that contain fresh function symbols in their sources is operationally conservative. Bol and Groote [18, 33] supplied this conservative extension format with negative premises. Verhoef [49] showed that, under certain conditions, a transition rule in the extension can be allowed to have an original term as its source. D'Argenio and Verhoef [22, 23] formulated a generalization in the context of inequational specifications. Fokkink and Verhoef [25] relaxed the syntactic restrictions on the original TSS, and lifted the operational conservative extension result to higher-order languages. This column contains an exposition on existing conservative extension formats for SOS, and their applications with respect to term rewriting systems and completeness of axiomatizations. Predicates in SOS semantics can be coded as binary relations [34]. Moreover, negative premises can often be expres
{"title":"Conservative Extension in Structural Operational Semantics","authors":"L. Aceto, W. Fokkink, C. Verhoef","doi":"10.7146/BRICS.V6I24.20093","DOIUrl":"https://doi.org/10.7146/BRICS.V6I24.20093","url":null,"abstract":"Structural operational semantics (SOS) [44] provides a framework to give an operational semantics to programming and specification languages. In particular, because of its intuitive appeal and flexibility, SOS has found considerable application in the study of the semantics of concurrent processes. SOS generates a labelled transition system, whose states are the closed terms over an algebraic signature, and whose transitions are supplied with labels. The transitions between states are obtained inductively from a transition system specification (TSS), which consists of so-called transition rules of the form premises / conclusion . A typical example of a transition rule is: ... stipulating that if t -> t' holds for closed terms t and t', then so does t||u -> t'||u for each closed term u. In general, validity (or invalidity) of the positive (or negative) premises of a transition rule, under a certain substitution implies validity of the conclusion of this rule under the same substitution. This column is an excerpt from [2], which gives an overview of recent results in the field of SOS, with an emphasis on existing formats for TSSs. Each of these formats comes equipped with a rich body of results that are guaranteed to hold for any process calculus whose TSS is within that format. Over and over again, process calculi such as CCS [40], CSP [47], and ACP [11] have been extended with new features, and the TSSs that provide the operational semantics for these process algebras were extended with transition rules to describe these features; see, e.g. [10] for a systematic approach. A question that arises naturally is whether or not the original and the extended TSS induce the same transitions t -> t' for closed terms t in the original domain. Usually it is desirable that an extension is operationally conservative, meaning that the provable transitions for an original term are the same both in the original and in the extended TSS. Groote and Vaandrager [34, Thm. 7.6] proposed syntactic restrictions on a TSS, which automatically yield that an extension of this TSS with transition rules that contain fresh function symbols in their sources is operationally conservative. Bol and Groote [18, 33] supplied this conservative extension format with negative premises. Verhoef [49] showed that, under certain conditions, a transition rule in the extension can be allowed to have an original term as its source. D'Argenio and Verhoef [22, 23] formulated a generalization in the context of inequational specifications. Fokkink and Verhoef [25] relaxed the syntactic restrictions on the original TSS, and lifted the operational conservative extension result to higher-order languages. This column contains an exposition on existing conservative extension formats for SOS, and their applications with respect to term rewriting systems and completeness of axiomatizations. Predicates in SOS semantics can be coded as binary relations [34]. Moreover, negative premises can often be expres","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116863558","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}
Pub Date : 1997-06-18DOI: 10.7146/BRICS.V4I48.19269
P. Mosses
An open collaborative effort has been initiated: to design a common framework for algebraic specification and development of software. The rationale behind this initiative is that the lack of such a common framework greatly hinders the dissemination and application of research results in algebraic specification. In particular, the proliferation of specification languages, some differing in only quite minor ways from each other, is a considerable obstacle for the use of algebraic methods in industrial contexts, making it difficult to exploit standard examples, case studies and training material. A common framework with widespread acceptance throughout the research community is urgently needed. The aim is to base the common framework as much as possible on a critical selection of features that have already been explored in various contexts. The common framework will provide a family of specification languages at different levels: a central, reasonably expressive language, called CASL, for specifying (requirements, design, and architecture of) conventional software; restrictions of CASL to simpler languages, for use primarily in connection with prototyping and verification tools; and extensions of CASL, oriented towards particular programming paradigms, such as reactive systems and object-based systems. It should also be possible to embed many existing algebraic specification languages in members of the CASL family. A tentative design for CASL has already been proposed. Task groups are studying its formal semantics, tool support, methodology, and other aspects, in preparation for the finalization of the design.
{"title":"CoFI: The Common Framework Initiative for Algebraic Specification","authors":"P. Mosses","doi":"10.7146/BRICS.V4I48.19269","DOIUrl":"https://doi.org/10.7146/BRICS.V4I48.19269","url":null,"abstract":"An open collaborative effort has been initiated: to design a common framework for algebraic specification and development of software. The rationale behind this initiative is that the lack of such a common framework greatly hinders the dissemination and application of research results in algebraic specification. In particular, the proliferation of specification languages, some differing in only quite minor ways from each other, is a considerable obstacle for the use of algebraic methods in industrial contexts, making it difficult to exploit standard examples, case studies and training material. A common framework with widespread acceptance throughout the research community is urgently needed. The aim is to base the common framework as much as possible on a critical selection of features that have already been explored in various contexts. The common framework will provide a family of specification languages at different levels: a central, reasonably expressive language, called CASL, for specifying (requirements, design, and architecture of) conventional software; restrictions of CASL to simpler languages, for use primarily in connection with prototyping and verification tools; and extensions of CASL, oriented towards particular programming paradigms, such as reactive systems and object-based systems. It should also be possible to embed many existing algebraic specification languages in members of the CASL family. A tentative design for CASL has already been proposed. Task groups are studying its formal semantics, tool support, methodology, and other aspects, in preparation for the finalization of the design.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"342 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124223855","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：