scientific article; zbMATH DE number 1263840
From MaRDI portal
Publication:4234763
zbMath0912.68035MaRDI QIDQ4234763
Publication date: 16 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42) Theory of software (68N99)
Related Items
Verification in loosely synchronous queue-connected discrete timed automata., Honesty by Typing, Normalization of Linear Horn Clauses, Verification of well-formed communicating recursive state machines, Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences, Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism, On Decidability of LTL+Past Model Checking for Process Rewrite Systems, Decidability of model checking with the temporal logic EF, Deciding bisimulation-like equivalences with finite-state processes, Decidable models of integer-manipulating programs with recursive parallelism, Model checking for process rewrite systems and a class of action-based regular properties, On decidability of LTL model checking for process rewrite systems, Process rewrite systems.
Uses Software
