scientific article

Twan Basten, Michel Reniers, Jos C. M. Baeten

Publication date: 5 February 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

verification process algebra specification parallel and distributed software systems

Specification and verification (program logics, model checking, etc.) (68Q60) 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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (53)

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ Axiomatizing GSOS with termination ⋮ The Equational Theory of Weak Complete Simulation Semantics over BCCSP ⋮ Bisimulation maps in presheaf categories ⋮ Axiomatizing recursion-free, regular monitors ⋮ On Rule Formats for Zero and Unit Elements ⋮ A Pre-congruence Format for XY-simulation ⋮ Dynamic Logic with Binders and Its Application to the Development of Reactive Systems ⋮ Language Representability of Finite P/T Nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reactive Turing machines ⋮ On the minimality of some generating sets of the aggregation clone on a finite chain ⋮ On the axiomatisability of priority. III: Priority strikes again ⋮ Paraconsistent Transition Systems ⋮ Product line process theory ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ Formal modeling of evolving self-adaptive systems ⋮ Repairing time-determinism in the process algebra for hybrid systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Higher-Order Calculus of Computational Fields ⋮ Unguarded recursion on coinductive resumptions ⋮ Unique solutions of contractions, CCS, and their HOL formalisation ⋮ A Context-Free Process as a Pushdown Automaton ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Maximally permissive controlled system synthesis for non-determinism and modal logic ⋮ Rule formats for distributivity ⋮ A Basic Parallel Process as a Parallel Pushdown Automaton ⋮ Unifying Semantics for Concurrent Programming ⋮ Dynamic consistency in process algebra: from paradigm to ACP ⋮ SOS rule formats for zero and unit elements ⋮ Unguardedness mostly means many solutions ⋮ The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Unnamed Item ⋮ A logic for the stepwise development of reactive systems ⋮ Toward an algebraic theory of systems ⋮ Verification of Context-Dependent Channel-Based Service Models ⋮ Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study ⋮ Towards `up to context' reasoning about higher-order processes ⋮ Unnamed Item ⋮ Equations, Contractions, and Unique Solutions ⋮ Unnamed Item ⋮ Reactive Turing Machines ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP ⋮ Generic Models of the Laws of Programming ⋮ Unnamed Item ⋮ A Generic Process Algebra

This page was built for publication: