A smart contract is a computer program that allows users to automate their actions on the
blockchain platform. Given the significance of smart contracts in supporting important …

Timed automata are a common formalism for the verification of concurrent systems subject to
timing constraints. They extend finite-state automata with clocks, that constrain the system …

Decentralized finance (DeFi) has become one of the most successful applications of
blockchain and smart contracts. The DeFi ecosystem enables a wide range of crypto …

Modeling and verifying complex real-time systems are challenging research problems. The
de facto approach is based on Timed Automata, which are finite state automata equipped …

As a recently proposed membrane computing model, cP systems are capable of solving
computational hard and distributed problems. Although several membrane system variants …

Abstract Model checking is a formal verification technique. It takes an exhaustively strategy
to check hardware circuits and network protocols against desired properties. Having been …

In the past, networks have been mainly optimized for good system throughput but recently
achieving low delay has also gained notable traction. Active Queue Management (AQM) has …

We outline a probabilistic denotational semantics for the RoboChart language, a
diagrammatic, domain-specific notation for describing robotic controllers with their hardware …

Linearizability is an important correctness criterion for implementations of concurrent
objects. Automatic checking of linearizability is challenging because it requires checking …

Abstract A parallel thinning algorithm [1](Holt etc.) is compared with algorithm [2](Rutovitz)
and [3](Zhang and Suen). Analyses and experiments show that the algorithm [1] is similar to …