A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Van Glabbeek's linear time-branching time spectrum is one of the most relevant work on comparative study on process semantics, in which semantics are partially ordered by their discrimination power. ... In this paper we bring forward a refinement of this classification and show how the process semantics can be dealt with in a uniform way: based on the very natural concept of constrained simulation we ... Figure 10 :Figure 11 : 1011 Basic layer in the linear time-branching time spectrum. Semantics in the new linear time-branching time spectrum. ...doi:10.2168/lmcs-9(2:11)2013 fatcat:ktbqvkt5pzaerepj7acsewo7ra
Lecture Notes in Computer Science
Van Glabbeek's linear time-branching time spectrum provides a classification of most of these semantics; however, no suitable unified definitions were available. ... The complexity of parallel systems has produced a large collection of semantics for processes. ... Indeed, this is not very surprising since the spectrum of semantics of concurrency was already called the linear time-branching time spectrum. ...doi:10.1007/978-3-540-95891-8_27 fatcat:vviuy46pojbphjynusk6pj7ljq
We start by considering the classic linear time-branching time spectrum developed by R.J. van Glabbeek. ... We continue with the task of obtaining a unifying view of process semantics by considering in this case the logical characterization of the semantics. ... Van Glabbeek's logical characterizations for process semantics Van Glabbeek also presented in  a logical characterization of the semantics in the (classical) linear time-branching time spectrum. ...doi:10.4204/eptcs.62.4 fatcat:f5f4rgmxjfarbmws5dmxlitpye
We show in the present paper that this framework of graded semantics does subsume the most important equivalences from the linear time -branching time spectrum. ... In the case of labelled transition systems, these equivalences range from trace equivalence to (strong) bisimilarity, and are organized in what is known as the linear time -branching time spectrum. ... Example 6.5 (Expressive graded logics on the linear time -branching time spectrum). ...doi:10.4230/lipics.concur.2019.36 dblp:conf/concur/DorschMS19 fatcat:eld6nrsmnrhqnluzpr6cxklmlm
J. van Glabbeek, The linear time—branching time spectrum. I. ... “Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. In Chapter 1, “The linear time - branching time spectrum. ...
The complexity of parallel systems has produced a large collection of semantics for processes, a classification of which is provided by Van Glabbeek's linear time-branching time spectrum; however, no suitable ... a generic axiom (ND) for reducing the non-determinism of processes, by means of which we introduce the additional identifications induced by each of the linear time semantics. ... Fig. 1 . 1 Semantics in the linear time-branching time spectrum. ...doi:10.1016/j.entcs.2009.07.093 fatcat:ouod5xhgdnhoxdjsqjim4riexq
We show in the present paper that this framework of graded semantics does subsume the most important equivalences from the linear time -- branching time spectrum. ... In the particular case of labelled transition systems, these equivalences range from trace equivalence to (strong) bisimilarity, and are organized in what is known as the linear time -- branching time ... Example 6.5 (Expressive graded logics on the linear time -branching time spectrum). ...arXiv:1812.01317v3 fatcat:ds6ktiukdje3bjxhnso2i2gqkm
Quantitative aspects of computation are related to the use of both physical and mathematical quantities, including time, performance metrics, probability, and measures for reliability and security. ... In the same period, they represented the central theme of the series of workshops entitled Quantitative Aspects of Programming Languages and Systems (QAPL) and born in 2001. ... Several studies concern extensions of classical linear-time and branching-time logics. ...doi:10.4204/eptcs.312.1 fatcat:4fjvygbppjbq3k5ury2kvue3nq
We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time ... We prove that the induced algorithm can determine the best fit of (in)equivalences for a pair of processes. ... We are thankful to members of the MTV research group and the reviewers of TACAS'21 and LMCS for lots of helpful comments. Data availability. ...arXiv:2109.15295v6 fatcat:6ymtpyoh3nguxjjijdyfredsua
% fewer parameters in the semantic branch. ... To this end, we propose an efficient Attention module -- Lintention which can model long-range interactions in linear time using linear space. ... As our main contributions lie in the semantic branch, we analyze the complexity of the baseline semantic branch and our proposed four semantic branches, which does not depend on the content of the specific ...arXiv:2103.04128v1 fatcat:2yx2mpq355cq3ewhcv4yszo62y
Lecture Notes in Computer Science
The generalized results are shown to be useful for studying semantics of programming languages. ... Some topological properties of the operational semantic models and the so-called higher order transformations induced by labelled transition systems satisfying one of the niteness conditions are discussed ... Acknowledgements The author would like to thank the members of the Amsterdam Concurrency Group including Jaco de Bakker, Frank de Boer, Marcello Bonsangue, Arie de Bruin, Jean-Marie Jacquet, Joost Kok, ...doi:10.1007/3-540-58201-0_83 fatcat:2ten3vsjljaklke3vyuxfgzsb4
Branching time versus linear time. The difference between branching-time and linear-time models lies in their treatment of the choices that systems face during their execution. ... A branching-time semantics is useful for modeling future behavior of a system, whereas linear time suffices for describing execution histories. ...doi:10.1145/242223.242252 fatcat:4gu2wurduveqdhqqrhr27yaqjq
We introduce branch and infer, a unifying framework for integer linear programming and finite domain constraint programming. ... Other key words: Integer programming, computational logic, semantics, branch and bound. ... We develop a general frame-work, branch and infer, that unifies the classical branch-andcut approach from integer linear programming  with the usual operational semantics of finite domain constraint ...doi:10.1287/ijoc.10.3.287 fatcat:snbvvnozqfff3j6tjhz7ujkkcq
J. van Glabbeek, The linear time-branching time spectrum (extended abstract) (pp. 278-297); E. ... Forman, Superimposition for interacting processes (pp. 230-245); Lars-dke Fredlund, Bengt Jonsson and Joachim Parrow, An implementation of a translational semantics for an imperative language (pp. 246- ...
[A semantic approach] “Radio i Svyaz’”’, Moscow, 1991. 400 pp. 4.80 r. ISBN 5-256-00638-X There exists a wide spectrum of programming languages. ... processes; (8) Macros. ...
« Previous Showing results 1 — 15 out of 6,859 results