scientific article; zbMATH DE number 1222559
From MaRDI portal
Publication:4218096
zbMath0942.68075MaRDI QIDQ4218096
Publication date: 2 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Model theory of finite structures (03C13)
Related Items
Unnamed Item ⋮ Recursively defined metric spaces without contraction ⋮ Automated generation of program translation and verification tools using annotated grammars ⋮ Branching vs. Linear Time: Semantical Perspective ⋮ Implicit, explicit and speculative knowledge ⋮ Decidability of branching bisimulation on normed commutative context-free processes ⋮ Weak bisimilarity and regularity of context-free processes is EXPTIME-hard ⋮ Semantics for knowledge and change of awareness ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Unnamed Item ⋮ (Bi)simulations up-to characterise process semantics ⋮ Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes ⋮ Swinging types=functions+relations+transition systems
