A logic characteristic for timed extensions of partial order based equivalences

Authors:
Natalya S. Gribovskaya
Affiliations:
A.P. Ershov Institute of Informatics Systems, SB RAS, Novosibirsk, Russia
Venue:
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Year:
2011

Citing 10
Cited 0

Concurrency and atomicity

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Bisimulation open maps for timed transition systems

Fundamenta Informaticae - Special issue dedicated to A. Salomaa
On Specifying Real-Time Systems in a Causality-Based Setting

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Obseving Behaviour Categorically

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
An introduction to event structures

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Higher Dimensional Transition Systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Open Maps and Observational Equivalences for Timed Partial Order Models

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Open maps bisimulations for higher dimensional automata models

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A Categorical View of Timed Behaviours

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The intention of the paper is to provide a uniform logic characteristic for timed extensions of partial order based equivalences (pomset trace equivalence, history preserving bisimulation and hereditary history preserving bisimulation) in the setting of timed event structures. For this purpose, we use open maps based characterizations of the equivalences, provided in [10], and the logics of path assertions from [6].