Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time

Authors:
Mario Bravetti
Affiliations:
Dipartimento di Scienze dell'Informazione, Università di Bologna, Bologna, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 8
Cited 0

Petri net models for algebraic theories of concurrency

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
A complete axiomatisation for observational congruence of finite-state behaviours

Information and Computation
A process algebra for timed systems

Information and Computation
A compositional approach to performance modelling

A compositional approach to performance modelling
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement

ACM Transactions on Computational Logic (TOCL)
The theory of interactive generalized semi-Markov processes

Theoretical Computer Science
A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A ground-complete axiomatization of finite state processes in process algebra

CONCUR 2005 - Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present our work on extending the standard machinery for weak bisimulation to deal with: finite-state processes of calculi with a full signature, including static operators like parallel; semantic action refinement and ST bisimulation; maximal-progress, i.e. priority of standard actions over unprioritized actions; representation of time: discrete real-time and Markovian stochastic time. For every such topic we show that it is possible to resort simply to weak bisimulation and that we can exploit this to obtain, via modifications to the standard machinery: finite-stateness of semantic models when static operators are not replicable by recursion, as for CCS with the standard semantics, thus yielding decidability of equivalence; structural operational semantics for terms; a complete axiomatization for finite-state processes via a modification of the standard theory of standard equation sets and of the normal-form derivation procedure.