Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Extensional equivalence for transition systems
Acta Informatica
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Process algebra
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
Models of nondeterministic regular expressions
Journal of Computer and System Sciences
Communication and Concurrency
Process Algebra with a Zero Object
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Fully Abstract Models for Nondeterministic Regular Expressions
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Resource bisimilarity and graded bisimilarity coincide
Information Processing Letters
| Hi-index | 0.00 |
The logical characterization of the strong and the weak (ignoring silent actions) versions of resource bisimulation are studied. The temporal logics we introduce are variants of Hennessy-Milner Logics that use graded modalities instead of the classical box and diamond operators. The considered strong bisimulation induces an equivalence that, when applied to labelled transition systems, permits identifying all and only those systems that give rise to isomorphic unfoldings. Strong resource bisimulation has been used to provide nondeterministic interpretation of finite regular expressions and new axiomatizations for them. Here we generalize this result to its weak variant.