Communicating sequential processes
Communicating sequential processes
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Three partition refinement algorithms
SIAM Journal on Computing
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Process algebra
Maximality preserving bisimulation
Theoretical Computer Science
Bisimulation and action refinement
Selected papers of the 3rd workshop on Concurrency and compositionality
Towards action-refinement in process algebras
Information and Computation
On "Axiomatising Finite Concurrent Processes"
SIAM Journal on Computing
Adding action refinement to a finite process algebra
Information and Computation
Split and ST bisimulation semantics
Information and Computation
A causal operational semantics of action refinement
Information and Computation
Timed testing of concurrent systems
Information and Computation
Location equivalence in a parametric setting
Theoretical Computer Science
On the decidability of non-interleaving process equivalences
Fundamenta Informaticae
Communication and Concurrency
Handbook of Process Algebra
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
On Plain and Hereditary History-Preserving Bisimulation
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Minimal Transition Systems for History-Preserving Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Towards Performance Evaluation with General Distributions in Process Algebras
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Axiomatising ST-Bisimulation Equivalence
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Partial orderings descriptions and observations of nondeterministic concurrent processes
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
A ground-complete axiomatization of finite state processes in process algebra
CONCUR 2005 - Concurrency Theory
Event Structures for Arbitrary Disruption
Fundamenta Informaticae
A regular viewpoint on processes and algebra
Acta Cybernetica
Electronic Notes in Theoretical Computer Science (ENTCS)
Action Refinement in Process Algebra and Security Issues
Logic-Based Program Synthesis and Transformation
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
Truly Concurrent Logic via In-Between Specification
Electronic Notes in Theoretical Computer Science (ENTCS)
Static livelock analysis in CSP
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
Event Structures for Arbitrary Disruption
Fundamenta Informaticae
Hi-index | 0.00 |
Due to the complex nature of bisimulation equivalences that express some form of history dependence, it turned out to be problematic to decide them over nontrivial classes of recursive systems. Moreover, to the best of our knowledge, the problem of axiomatizing them over such classes of systems has never been solved. In this article, we face this problem in the case of weak ST bisimulation, an equivalence that expresses the execution of an action as the combination of the two interdependent events of action start and action termination and that supports the operation of action refinement. We first consider a basic process algebra with CSP multiway synchronization and recursion and we show that a simple technique based on static names is sufficient to decide weak ST bisimulation over processes that are finite state according to the standard interleaving semantics. Then we introduce a different technique based on dynamic names and on the new idea of compositional level-wise renaming of actions (which produces semantic models via SOS such that weak ST bisimulation can be established through standard weak bisimulation) and we show that it can be applied to decide and axiomatize weak ST bisimulation over the same class of processes. Finally, we introduce a third technique based on pointers, updated according to a pseudo-stack discipline, which preserves the possibility of deciding and axiomatizing weak ST bisimulation also when an action refinement operator is considered.