Deciding bisimulation-like equivalences with finite-state processes

Jancar, Petr; Kučera, Antonín; Mayr, Richard

doi:10.1016/s0304-3975(00)00027-x

Cited by 40 publications

(50 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The natural coinductive definition of bisimulation does not lead to a guarded system for the Z f 's. However, for regular bisimulation, an alternative characterization leads to an inductive definition as we now explain (see also [58,65]). Recall the definition of the finite-depth approximants ∼ 0 ⊇ ∼ 1 ⊇ ∼ 2 ⊇ · · · of bisimulation:…”

Section: Theorem 32 Model Checking B(∃u ∃X ∧ ∨ ¬) Is Decidable Fomentioning

confidence: 96%

See 1 more Smart Citation

Computable fixpoints in well-structured symbolic model checking

Bertrand

Schnoebelen

2012

Form Methods Syst Des

View full text Add to dashboard Cite

We prove a general finite-time convergence theorem for fixpoint expressions over a well-quasi-ordered set. This has immediate applications for the verification of wellstructured systems, where a main issue is the computability of fixpoint expressions, and in particular for game-theoretical properties and probabilistic systems where nesting and alternation of least and greatest fixpoints are common.

show abstract

Section: Theorem 32 Model Checking B(∃u ∃X ∧ ∨ ¬) Is Decidable Fomentioning

confidence: 96%

“…In process algebra, so-called "regular" equivalences and preorders are behavioral relations between an arbitrary labeled transition system and a finite-state one (which is usually taken as a specification of the other process) [58,65].…”

Section: Regular Simulation For Monotonic Counter Systemsmentioning

confidence: 99%

Computable fixpoints in well-structured symbolic model checking

Bertrand

Schnoebelen

2012

Form Methods Syst Des

View full text Add to dashboard Cite

show abstract

“…• s tt for every process s. • L(EU ) is the logic proposed by de Nicola and Vaandrager in [10] which modally characterizes branching bisimilarity; • L(EX , EF, EF ) is the logic used in [17] to construct characteristic formulae w.r.t. full and weak bisimilarity for finite-state systems.…”

Section: Encoding Mt B Equivalence Into Modal Logicmentioning

confidence: 99%

A general approach to comparing infinite-state systems with their finite-state specifications

Kučera

Schnoebelen

2006

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The MSA class can be defined as BPP systems extended with a finite state control unit. A systematic state extension of all PRS classes, denoted by the prefix se-, is considered in [5]. Clearly, the classes of FS, PDA and PN coincide with their respective state-extended counterparts, and seBPA coincides with the PDA class.…”

Section: Introductionmentioning

confidence: 99%