The linear time - branching time spectrum

1990 ◽  
pp. 278-297 ◽  
Author(s):  
R. J. van Glabbeek
Keyword(s):  
Linear Time ◽  
Time Spectrum ◽  
Branching Time

scholarly journals A Game for Linear-time–Branching-time Spectroscopy

2021 ◽  
pp. 3-19
Author(s):  
Benjamin Bisping ◽  
Uwe Nestmann
Keyword(s):  
Linear Time ◽  
Time Spectrum ◽  
Branching Time ◽  
Finite State ◽  
Best Fit

AbstractWe introduce a generalization of the bisimulation game that can be employed to find all relevant distinguishing Hennessy–Milner logic formulas for two compared finite-state processes. By measuring the use of expressive powers, we adapt the formula generation to just yield formulas belonging to the coarsest distinguishing behavioral preorders/equivalences from the linear-time–branching-time spectrum. The induced algorithm can determine the best fit of (in)equivalences for a pair of processes.

scholarly journals Ready To Preorder: Get Your BCCSP Axiomatization for Free!

2007 ◽  
Vol 14 (3) ◽  
Author(s):  
Luca Aceto ◽  
Willem Jan Fokkink ◽  
Anna Ingólfsdóttir
Keyword(s):  
Process Algebra ◽  
Linear Time ◽  
Equational Theory ◽  
Time Spectrum ◽  
Basic Process ◽  
Branching Time ◽  
Discriminating Power

This paper contributes to the study of the equational theory of the semantics in van Glabbeek's linear time - branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of a behavioral congruence lying between ready simulation equivalence and partial traces equivalence from a complete (respectively, ground-complete) inequational axiomatization of its underlying precongruence--that is, of the precongruence whose kernel is the equivalence. The algorithm preserves finiteness of the axiomatization when the set of actions is finite. It follows that each equivalence in the spectrum whose discriminating power lies in between that of ready simulation and partial traces equivalence is finitely axiomatizable over the language BCCSP if so is its defining preorder.

scholarly journals Unifying Equivalences for Timed Transition Systems

10.29007/kkds ◽  
2018 ◽  
Author(s):  
Irina Virbitskaite ◽  
Natalya Gribovskaya ◽  
Eike Best
Keyword(s):  
Real Time ◽  
Linear Time ◽  
Time Spectrum ◽  
Branching Time ◽  
Real Time Systems ◽  
Transition Systems ◽  
Abstract Characterization ◽  
Time Systems ◽  
Open Maps

Timed transition systems are a widely studied model for real-time systems.The intention of the paper is to show how several categorical (open maps, path-bisimilarity and coalgebraic) approaches to an abstract characterization ofbisimulation relate to each other and to the numerous suggested behavioral equivalences of linear time -- branching time spectrum, in the setting of timed transition systems.

scholarly journals Bisimulations Up-to for the Linear Time Branching Time Spectrum

2005 ◽  
pp. 278-292 ◽  
Author(s):  
David de Frutos Escrig ◽  
Carlos Gregorio Rodríguez
Keyword(s):  
Linear Time ◽  
Time Spectrum ◽  
Branching Time
Sign in / Sign up

Export Citation Format

Share Document