Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Determinism → (event structure isomorphism = step sequence equivalence)
Theoretical Computer Science - Special issue: Part B: Logic, semantics, and theory of programming
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)
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
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
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
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Ordinal Processes in Comparative Concurrency Semantics
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
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)
Timed equivalences for timed event structures
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
| Hi-index | 0.00 |
The paper is contributed to develop a family of observational equivalences for timed true concurrent models. In particular, we introduce three different semantics (based on interleaving, steps, and partial orders of actions) for timed trace and timed bisimulation equivalences in the setting of event structures with dense time domain. We study the relationship between these three approaches and show their discriminating power. Furthermore, when dealing with particular subclasses of the model under consideration such as sequential and deterministic timed event structures there is no difference between a more concrete or a more abstract approach.