Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Testing equivalences for event structures
Advanced School on Mathematical models for the semantics of parallelism
Causal trees interleaving + causality
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Towards an algebra for timed behaviours
Theoretical Computer Science
History preserving, causal and mixed-ordering equivalence over stable event structures (note)
Fundamenta Informaticae
Theoretical Computer Science
Time and duration in noninterleaving concurrency
Fundamenta Informaticae
Analysis of timed concurrent models based on testing equivalence
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Communication and Concurrency
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Deciding Testing Equivalence for Real-Time Processes with Dense Time
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Metric Semantics for True Concurrent Real Time
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Efficient Scaling-Invariant Checking of Timed Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Observational Semantics for Timed Event Structures
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
| Hi-index | 0.00 |
The intention of the paper is to develop a framework for observational equivalences in the setting of a real-time partial order model. In particular, we introduce a family of equivalences of linear time – branching time spectrum based on interleaving, causal trees and partial order semantics, in the setting of event structures with dense time domain. We study the relationships between these approaches and show their discriminating power. Furthermore, when dealing with particular subclasses of the model under consideration there is no difference between a more concrete or a more abstract approach.