scientific article; zbMATH DE number 4119652
From MaRDI portal
Publication:4733426
zbMath0683.68066MaRDI QIDQ4733426
Jan A. Bergstra, Jan Willem Klop
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bisimulation semanticsconcurrent process theorycountably branching graphsinference systems for regular processes
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items (15)
A semantic characterization for faults in replicated systems ⋮ A framework for viewing atomic events in distributed computations ⋮ A completeness theorem for nondeterministic Kleene algebras ⋮ Timed mobility in process algebra and Petri nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Models of nondeterministic regular expressions ⋮ Compositionality in state space verification methods ⋮ Decidability of Weak Bisimilarity for a Subset of BPA ⋮ Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts ⋮ Mixed sessions ⋮ Absolute versus relative time in process algebras. ⋮ Pushdown processes: Games and model-checking ⋮ Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) ⋮ Comparative semantics for flow of control in logic programming without logic
This page was built for publication:
