scientific article; zbMATH DE number 4119652

MaRDI QIDQ4733426zbMATH OpenFDO

Authors J. A. Bergstra, Jan Willem Klop

Publication date 1989

zbMATH Keywords

bisimulation semanticsconcurrent process theorycountably branching graphsinference systems for regular processes

Mathematics Subject Classification ID

Theory of operating systems (68N25) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 4016181
• Processes as terms: non-well-founded models for bisimulation
• scientific article; zbMATH DE number 1829371
• scientific article; zbMATH DE number 3963182
• Bisimulation for higher-order process calculi
• Computable processes and bisimulation equivalence
• Bisimulation collapse and the process taxonomy
• On context bisimulation for parameterized higher-order processes
• scientific article; zbMATH DE number 1418352

Cited in

(27)

• A framework for viewing atomic events in distributed computations
• Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
• A semantic characterization for faults in replicated systems
• Absolute versus relative time in process algebras.
• Pushdown processes: Games and model-checking
• Models of nondeterministic regular expressions
• Mixed sessions
• Computable processes and bisimulation equivalence
• Context-free session types for applied pi-calculus
• Process Bisimulation Via a Graphical Encoding
• scientific article; zbMATH DE number 3963182 (Why is no real title available?)
• scientific article; zbMATH DE number 4056992 (Why is no real title available?)
• scientific article; zbMATH DE number 44290 (Why is no real title available?)
• Decision procedures and graph reductions for bisimulation equivalences part 1
• scientific article; zbMATH DE number 1231594 (Why is no real title available?)
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• Processes as terms: non-well-founded models for bisimulation
• Compositionality in state space verification methods
• Emergence in context-free parallel communicating grammar systems: what does and does not make a grammar system more expressive than its parts
• A completeness theorem for nondeterministic Kleene algebras
• Decidability of weak bisimilarity for a subset of BPA
• Algebra and Coalgebra in Computer Science
• Timed mobility in process algebra and Petri nets
• PAM: A process algebra manipulator
• Modal and temporal logics for processes
• Bisimulation for higher-order process calculi
• Comparative semantics for flow of control in logic programming without logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733426)