Unifying behavioral equivalences of timed transition systems

DOI10.1134/S0361768810030023zbMath1251.68163MaRDI QIDQ1758671

I. B. Virbitskaite, Nataliya Gribovskaya

Publication date: 16 November 2012

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

modeling; concurrency; timed transition systems; open maps; timed behavioral equivalences

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Cites Work

• A complete axiomatization of timed bisimulation for a class of timed regular behaviours
• A calculus of communicating systems
• A theory of timed automata
• Temporal proof methodologies for timed transition systems
• A completeness theorem for open maps
• Testing equivalences for processes
• A causal semantic for time Petri nets
• Bisimulation from open maps
• Timing and causality in process algebra
• Testing equivalence as a bisimulation equivalence
• Observing behaviour categorically
• Open Maps Bisimulations for Higher Dimensional Automata Models
• Timed Unfoldings for Networks of Timed Automata
• Formal Methods for the Design of Real-Time Systems
• Formal Methods for the Design of Real-Time Systems
• Foundations of Software Science and Computational Structures
• Formal Modeling and Analysis of Timed Systems
• Formal Modeling and Analysis of Timed Systems
• Formal Modeling and Analysis of Timed Systems
• Refinement of actions and equivalence notions for concurrent systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item