Search results for "Bisimulation"

showing 2 items of 2 documents

Decidability of bisimulation equivalences for parallel timer processes

1993

In this paper an abstract model of parallel timer processes (PTPs), allowing specification of temporal quantitative constraints on the behaviour of real time systems, is introduced. The parallel timer processes are defined in a dense time domain and are able to model both concurrent (with delay intervals overlapping on the time axis) and infinite behaviour. Both the strong and weak (abstracted from internal actions) bisimulation equivalence problems for PTPs are proved decidable. It is proved also that, if one provides the PTP model additionally with memory cells for moving timer value information along the time axis, the bisimulation equivalence (and even the vertex reachability) problems …

Discrete mathematicsCounter machineBisimulationVertex (graph theory)ReachabilityComputer scienceTime domainTimerAlgorithmUndecidable problemDecidability
researchProduct

Games and Bisimulations for Intuitionistic First-Order Kripke Models

2021

The aim of this paper is to introduce the notion of a game for intuitionisticfirst-order Kripke models. We also establish links between notions presented here and thenotions of logical equivalence and bounded bisimulation for intuitionistic first-order Kripkemodels, and the Ehrenfeucht–Fra ̈ıss ́e game for classical first-order structures.

Winning strategyBisimulationLogical equivalenceLogicIntuitionistic first-order logicKripke modelsGameEhrenfeucht–Fra ̈ıss ́e gameFirst orderAlgebraHistory and Philosophy of ScienceBounded functionComputational linguisticsKripke modelMathematicsStudia Logica
researchProduct