On the Decidability of Non-Interleaving Process Equivalences

Authors:
Astrid Kiehn;Matthew Hennessy
Affiliations:
Institut für Informatik, Technische Universität, München, Germany. kiehn@informatik.tu-muenchen.de;Cognitive and Computing Sciences, University of Sussex, Brighton, England. matthewh@cogs.sussex.ac.uk
Venue:
Fundamenta Informaticae
Year:
1997

Citing 18
Cited 0

Petri net models for algebraic theories of concurrency

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Distributed bisimulations

Journal of the ACM (JACM)
Finite representations of CCS and TCSP programs by automata and Petri nets

Finite representations of CCS and TCSP programs by automata and Petri nets
Causal trees interleaving + causality

Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Observing localities

Selected papers of the 3rd workshop on Concurrency and compositionality
Towards action-refinement in process algebras

Information and Computation
Comparing locality and causality based equivalences

Acta Informatica
Communication and Concurrency

Communication and Concurrency
Modular Construction and Partial Order Semantics of Petri Nets

Modular Construction and Partial Order Semantics of Petri Nets
On Representing CCS Programs by Finite Petri Nets

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
A Semantics Based Verification Tool for Finite State Systems

Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Causal Trees

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A Theory of Process with Localities (Extended Abstract)

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for all Context-Free Processes

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On the Decidability of Non-Interleaving Process Equivalences

CONCUR '94 Proceedings of the Concurrency Theory
Partial orderings descriptions and observations of nondeterministic concurrent processes

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop decision procedures based on proof tableaux for a number of non-interleaving equivalences over processes. The processes considered are those which can be described in a simple extension of BPP r, Basic Parallel Processes with communication, obtained by omitting the restriction operator from CCS. Decision procedures are given for both strong and weak versions of location equivalence and ST-bisimulation.