Defining distances for all process semantics

Authors:
David Romero Hernández;David de Frutos Escrig
Affiliations:
Dpto. Sistemas Informáticos y Computación Facultad CC. Matemáticas, Universidad Complutense de Madrid, Spain;Dpto. Sistemas Informáticos y Computación Facultad CC. Matemáticas, Universidad Complutense de Madrid, Spain
Venue:
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Year:
2012

Citing 11
Cited 0

Modal and temporal logics for processes

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Bisimulation, Games, and Logic

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
Synchronisation Trees

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Game Characterizations of Process Equivalences

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
On the Unification of Process Semantics: Observational Semantics

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Safe Reasoning with Logic LTS

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Linear and Branching System Metrics

IEEE Transactions on Software Engineering
On the Unification of Process Semantics: Equational Semantics

Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative simulation games

Time for verification
Simulation distances

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Amortised bisimulations

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently several authors have proposed some notions of distance between processes that try to quantify "how far away" is a process to be related with some other with respect to a certain semantics. These proposals are usually based on the simulation game, and therefore are mainly defined for simulation semantics or other semantics more or less close to these. These distances have a local character since only one of the successors of each state is taken into account in their computation. Here, we present an alternative proposal exploiting the fact that processes are trees. We define the distance between two of them as the cost of the transformations that we need to apply to get two processes related by the corresponding semantics. Our new distances can be uniformly defined for all the semantics in the ltbt-spectrum.