Communicating sequential processes
Communicating sequential processes
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Testing equivalences for event structures
Advanced School on Mathematical models for the semantics of parallelism
Towards an algebra for timed behaviours
Theoretical Computer Science
Refinement of actions in event structures and causal trees
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
History preserving, causal and mixed-ordering equivalence over stable event structures (note)
Fundamenta Informaticae
Theoretical Computer Science
An event structure semantics for general Petri nets
Theoretical Computer Science - Special volume on Petri nets
Theoretical Computer Science - Special volume on Petri nets
Timing and causality in process algebra
Acta Informatica
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
A Calculus of Communicating Systems
A Calculus of Communicating Systems
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
Testing, Betting and Timed True Concurrency
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Causal Trees: Interleaving + Causality
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th 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 equivalences for timed event structures
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Semantic domains of timed event structures
Programming and Computing Software
Unifying behavioral equivalences of timed transition systems
Programming and Computing Software
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
The intention of the paper is to develop a framework for weak 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 tree and partial order semantics, in the setting of a dense time extension of stable event structures with internal actions. We study the relationships between the equivalences showing, on one hand, the discriminating power of the approaches of the spectrum and, on the other hand, the coincidence of some semantics in a concrete approach. Furthermore, when dealing with particular subclasses of the model under consideration, there is no difference between more concrete and more abstract observations.