scientific article
From MaRDI portal
zbMath0786.68061MaRDI QIDQ4037108
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
verificationpartial ordersprogram correctnessconcurrent finite-state systemsMazurkiewicz's tracesmodeling of concurrencyone-safe PIT-netstrace automaton
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
A technique of state space search based on unfolding, Compositional verification of concurrent systems by combining bisimulations, A pragmatic approach to stateful partial order reduction, The Birth of Model Checking, Sequential and distributed on-the-fly computation of weak tau-confluence, Reachability analysis based on structured representations, A stubborn attack on state explosion, Specification and automatic verification of self-timed queues, Combining partial-order reductions with on-the-fly model-checking., Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic, Stubborn Sets, Frozen Actions, and Fair Testing, A partial order approach to branching time logic model checking., Compositional verification of asynchronous concurrent systems using CADP
