Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Modeling concurrency with partial orders
International Journal of Parallel Programming
Testing equivalences for event structures
Advanced School on Mathematical models for the semantics of parallelism
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Bisimulation and action refinement
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Towards an algebra for timed behaviours
Theoretical Computer Science
Theoretical Computer Science
Time and duration in noninterleaving concurrency
Fundamenta Informaticae
Handbook of logic in computer science (vol. 4)
Timing and causality in process algebra
Acta Informatica
Bisimulation open maps for timed transition systems
Fundamenta Informaticae - Special issue dedicated to A. Salomaa
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
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th 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
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
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
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
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
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
Semantic domains of timed event structures
Programming and Computing Software
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Real-time stable event structures and marked scott domains: an adjunction
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Open maps bisimulations for higher dimensional automata models
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
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
Timed equivalences for timed event structures
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
A logic characteristic for timed extensions of partial order based equivalences
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Hi-index | 0.00 |
The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of timed extensions of partial order models, in order to transfer general concepts of equivalences to the models. In particular, we define categories of timed event structures, whose morphisms are to be thought of as simulations, and accompanying (sub)categories of observations, to which the corresponding notions of open maps are developed. We then use the open maps framework to obtain abstract bisimilarities which are established to coincide with timed extensions of well-known partial order based equivalences.