CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings

zbMath0746.68005MaRDI QIDQ1188866

No author found.

Publication date: 17 September 1992

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

Proceedingsconcurrent systemsprocess algebraPetri netsequivalencesconcurrencyprocessescommunicating systemsprocess specificationssemantics of concurrent programsAmsterdam (The Netherlands)CONCUR '90

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (34)

Rewriting logic: Roadmap and bibliography ⋮ Compositionality of Hennessy-Milner logic by structural operational semantics ⋮ Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours ⋮ A general SOS theory for the specification of probabilistic transition systems ⋮ Axiomatizing recursion-free, regular monitors ⋮ On the operational semantics of nondeterminism and divergence ⋮ Branching bisimilarity is an equivalence indeed! ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Duplication of constants in process algebra ⋮ Metrics for labelled Markov processes ⋮ Execution architectures for program algebra ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Keep it fair: equivalence and composition ⋮ Probabilistic weak bisimulation and axiomatization for probabilistic models ⋮ Strategies in conditional narrowing modulo SMT plus axioms ⋮ Extensible Proof Systems for Infinite-State Systems ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Characteristic Formulae for Timed Automata ⋮ Confluence for process verification ⋮ Probabilistic communicating processes ⋮ A complete axiomatization of timed bisimulation for a class of timed regular behaviours ⋮ Quantitative Kleene coalgebras ⋮ The fixed-point theory of strictly causal functions ⋮ The equational theory of prebisimilarity over basic CCS with divergence ⋮ On the metric-based approximate minimization of Markov chains ⋮ Process algebra for performance evaluation ⋮ Petri nets with name creation for transient secure association ⋮ Unnamed Item ⋮ Basic observables for processes ⋮ Object-oriented hybrid systems of coalgebras plus monoid actions ⋮ Measure and probability for concurrency theorists ⋮ Testing preorders for probabilistic processes. ⋮ Which data types have \(\omega\)-complete initial algebra specifications? ⋮ Additive models of probabilistic processes

This page was built for publication: CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings