Filters








6,859 Hits in 12.1 sec

Unifying the Linear Time-Branching Time Spectrum of Process Semantics

David de Frutos Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino, David Romero Hernández, Matthew Hennessy
2013 Logical Methods in Computer Science  
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

On the Unification of Process Semantics: Observational Semantics [chapter]

David de Frutos Escrig, Carlos Gregorio Rodríguez, Miguel Palomino
2009 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

On the Unification of Process Semantics: Logical Semantics

David Romero-Hernández, David de Frutos-Escrig
2011 Electronic Proceedings in Theoretical Computer Science  
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 [6] a logical characterization of the semantics in the (classical) linear time-branching time spectrum.  ... 
doi:10.4204/eptcs.62.4 fatcat:f5f4rgmxjfarbmws5dmxlitpye

Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum

Ulrich Dorsch, Stefan Milius, Lutz Schröder, Michael Wagner
2019 International Conference on Concurrency Theory  
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

Page 2766 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
J. van Glabbeek, The linear timebranching 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.  ... 

On the Unification of Process Semantics: Equational Semantics

David de Frutos Escrig, Carlos Gregorio Rodríguez, Miguel Palomino
2009 Electronical Notes in Theoretical Computer Science  
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

Graded Monads and Graded Logics for the Linear Time – Branching Time Spectrum [article]

Ulrich Dorsch, Stefan Milius, Lutz Schröder
2020 arXiv   pre-print
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 Programming Languages and Systems over the past 2^4 years and beyond

Alessandro Aldini
2020 Electronic Proceedings in Theoretical Computer Science  
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

Deciding All Behavioral Equivalences at Once: A Game for Linear-Time–Branching-Time Spectroscopy [article]

Benjamin Bisping, David N. Jansen, Uwe Nestmann
2022 arXiv   pre-print
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

Panoptic Lintention Network: Towards Efficient Navigational Perception for the Visually Impaired [article]

Wei Mao, Jiaming Zhang, Kailun Yang, Rainer Stiefelhagen
2021 arXiv   pre-print
% 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

Generalizing finiteness conditions of labelled transition systems [chapter]

Franck Breugel
1994 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

Strategic directions in concurrency research

Rance Cleaveland, Scott A. Smolka
1996 ACM Computing Surveys  
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

Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming

Alexander Bockmayr, Thomas Kasper
1998 INFORMS journal on computing  
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 [37] with the usual operational semantics of finite domain constraint  ... 
doi:10.1287/ijoc.10.3.287 fatcat:snbvvnozqfff3j6tjhz7ujkkcq

Page 3951 of Mathematical Reviews Vol. , Issue 91G [page]

1991 Mathematical Reviews  
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-  ... 

Page 6400 of Mathematical Reviews Vol. , Issue 92k [page]

1992 Mathematical Reviews  
[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