scientific article
From MaRDI portal
Publication:3774929
zbMath0635.68014MaRDI QIDQ3774929
Jan Willem Klop, Jan A. Bergstra, Jos C. M. Baeten
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Theory of operating systems (68N25)
Related Items (25)
Graphes canoniques de graphes algébriques ⋮ simpA: an agent-oriented approach for programming concurrent applications on top of Java ⋮ How to Parallelize sequential processes ⋮ Infinite results ⋮ Bisimulation collapse and the process taxonomy ⋮ Automated analysis of mutual exclusion algorithms using CCS ⋮ Deciding Bisimilarity of Full BPA Processes Locally ⋮ On deciding some equivalences for concurrent processes ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ A short proof of the decidability of bisimulation for normed BPA- processes ⋮ On the regular structure of prefix rewriting ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Well-structured transition systems everywhere! ⋮ Polymorphic higher-order context-free session types ⋮ The regular viewpoint on PA-processes ⋮ Basic process algebra with deadlocking states ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Recursive process definitions with the state operator ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ Context-free event domains are recognizable ⋮ Decision procedures and graph reductions for bisimulation equivalences part 1 ⋮ Complete formal systems for equivalence problems ⋮ On deciding trace equivalences for processes ⋮ Prototyping Concurrent Systems with Agents and Artifacts: Framework and Core Calculus ⋮ Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
This page was built for publication:
