A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Communication and concurrency
Contractions in comparing concurrency semantics
Theoretical Computer Science
Process algebra
CCS + time = an interleaving model for real time systems
Proceedings of the 18th international colloquium on Automata, languages and programming
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Theoretical Computer Science
A timed Full LOTOS with time/action tree semantics
Theories and experiences for real-time system development
Theories and experiences for real-time system development
A process algebra for timed systems
Information and Computation
Handbook of logic in computer science (vol. 4)
Handbook of logic in computer science (vol. 3)
Time-abstracted bisimulation: implicit specifications and decidability
Information and Computation
Program Verification
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Comparative Metric Semantics of Programming
Comparative Metric Semantics of Programming
Generalized Finiteness Conditions of Labelled Transition Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Universal coalgebra: a theory of systems
Universal coalgebra: a theory of systems
Additive models of probabilistic processes
Theoretical Computer Science
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Characterize branching distance in terms of (η,α)-bisimilarity
Information and Computation
A Behavioural Pseudometric based on λ--Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
An algebra of quantum processes
ACM Transactions on Computational Logic (TOCL)
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Automatica (Journal of IFAC)
Two-thirds simulation indexes and modal logic characterization
Frontiers of Computer Science in China
Value-passing CCS with noisy channels
Theoretical Computer Science
Bisimulation for Quantum Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hi-index | 5.23 |
Bisimulation expresses the equivalence of processes whose external actions are identical. Sometimes we may meet two processes which are not exactly bisimilar but more or less bisimilar in the sense that whenever a process makes an action the other can make an action different from but very similar to the action performed by the first one. To describe this kind of looser bisimulations we propose the concept of bisimulation index in a labelled transition system and give its various properties, especially those properties related to the operations of transition systems. Furthermore, we establish a modal logical characterization of bisimulation indexes. This characterization is a generalization of Hennessy-Milner logic. We study strong and weak bisimulation indexes in the basic asynchronous process calculus, and some of their fundamental properties are derived. Bisimulation indexes are not substitutive under composition. To overcome this defect we introduce an approximate communication rule to replace the original rule in process calculus. This enables us to recover some useful properties of composition with respect to bisimulation indexes. Finally, we present three examples in timed CCS and real time ACP to demonstrate the usage of bisimulation indexes in the analysis of real time systems. These examples show that bisimulation indexes are suitable formal tools for describing approximate implementations of real time systems.