scholarly journals Infinite Trace Equivalence

2006 ◽  
Vol 155 ◽  
pp. 467-496 ◽  
Author(s):  
Paul Blain Levy
Keyword(s):  
Trace Equivalence

scholarly journals Infinite trace equivalence

2008 ◽  
Vol 151 (2-3) ◽  
pp. 170-198 ◽  
Author(s):  
Paul Blain Levy
Keyword(s):  
Trace Equivalence

Step bisimulation is pomset equivalence on a parallel language without explicit internal choice

1993 ◽  
Vol 3 (1) ◽  
pp. 25-62 ◽  
Author(s):  
Douglas R. Troeger
Keyword(s):  
Equivalence Classes ◽  
Binary Choice ◽  
Parallel Composition ◽  
Focus Attention ◽  
Semantic Level ◽  
Parallel Language ◽  
Bisimulation Equivalence ◽  
Local Nondeterminism ◽  
Trace Equivalence ◽  
Single Set

We focus attention on a language ℒ generated by a set of elementary actions under operations of sequential composition, external binary choice, iteration, and non-nested disjoint parallel composition: that is, on an especially simple parallel language without explicit internal, or ‘local’, nondeterminism. ℒ is nondeterministic, despite the restriction to external choice, since a given action may occur in both subterms F and G of the parallel composition F ║ G. We exhibit a single set of equations that axiomatizes both step bisimulation and pomset equivalence on ℒ Given that step bisimulation and pomset equivalence are incomparable on the language ℒ+ obtained from ℒ by relaxing just the constraint on choice, the coincidence of these equivalences on ℒ suggests that the elimination of explicit internal choice can result in simplifications at the semantic level. We reinforce this impression by showing for ℒ that step bisimulation (i) coincides with pomset bisimulation equivalence, (ii) is real-time consistent, and (iii) has step trees as concrete representatives of its equivalence classes. Moreover, we show that none of these results holds for the language ℒ+ Finally, step trace equivalence is proved not to coincide with step bisimulation equivalence on ℒ.

scholarly journals On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt

2007 ◽  
Vol 14 (5) ◽  
Author(s):  
Luca Aceto ◽  
Silvio Capobianco ◽  
Anna Ingólfsdóttir
Keyword(s):  
Process Algebra ◽  
Basic Process ◽  
Single Action ◽  
Finite Axiomatization ◽  
Finite Base ◽  
Special Case ◽  
Trace Equivalence

We study Basic Process Algebra with interrupt modulo complete trace equivalence. We show that, unlike in the setting of the more demanding bisimilarity, a ground complete finite axiomatization exists. We explicitly give such an axiomatization, and extend it to a finite complete one in the special case when a single action is present.

scholarly journals Approximate Completed Trace Equivalence of Three Dimensional t-Model Nonlinear Algebraic Hybrid Systems

2013 ◽  
Vol 7 (5) ◽  
pp. 1693-1697 ◽  
Author(s):  
Hao Yang ◽  
Jinzhao Wu ◽  
Zhiwei Zhang ◽  
Yang Liu
Keyword(s):  
Hybrid Systems ◽  
Three Dimensional ◽  
Trace Equivalence

scholarly journals A Complete Axiomatisation for Probabilistic Trace Equivalence

2020 ◽  
Vol 30 (1) ◽  
pp. 69-104
Author(s):  
Ferry Timmers ◽  
◽  
Jan Friso Groote ◽  
Keyword(s):  
Trace Equivalence

scholarly journals Simplified Coalgebraic Trace Equivalence

2015 ◽  
pp. 75-90 ◽  
Author(s):  
Alexander Kurz ◽  
Stefan Milius ◽  
Dirk Pattinson ◽  
Lutz Schröder
Keyword(s):  
Trace Equivalence
Sign in / Sign up

Export Citation Format

Share Document