Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Theoretical Computer Science
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)
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
Efficient Scaling-Invariant Checking of Timed Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Testing Equivalence as a Bisimulation Equivalence
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
The Observational Power of Clocks
CONCUR '94 Proceedings of the 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
Obseving Behaviour Categorically
Proceedings of the 15th Conference 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
Time Processes for Time Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Timed CSP: Theory and Practice
Proceedings of the Real-Time: Theory in Practice, REX 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
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
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)
Open maps bisimulations for higher dimensional automata models
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Time supervision of concurrent systems using symbolic unfoldings of time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Is timed branching bisimilarity an equivalence indeed?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
A category of higher-dimensional automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
Timed transition systems are one of the most popular real-time models for concurrency. In the paper, various behavioral equivalences of timed transition systems are defined and studied. In particular, categories of this model are constructed, and their properties are studied. In addition, based on the open maps concept, abstract characterization of the considered equivalences is given. Such an approach makes it possible to develop a metatheory designed for unified definition and study of timed behavioral equivalences in the "linear time-branching time" spectrum of semantics.