Computer Science Stack Exchange
Computer Science Stack Exchange

Questions tagged [transition-systems]

30 questions
7
votes
4 answers

What is the difference (if any) between transition systems and finite automata?

is there any difference between transition systems and finite automata? Is it that transition systems consist of both NFA (nondeterministic finite automata) and DFA (deterministic finite automata)?
Isha
  • 73
  • 1
  • 4
3
votes
2 answers

Modelling a basic sequential circuit as a transition system?

I'm going through Dr Joost-Pieter Katoen's slides and stumbled upon this: For some reason I can't quite make out how the transition system relates to the sequential circuit. If I had a question for instance that asked me to convert the circuit into…
eyes enberg
  • 313
  • 3
  • 10
3
votes
1 answer

What is the difference between a Transition System and a Program Graph? (model checking)

As the above question says. I'm wondering if a transition system is the same as a program graph or they are two different things? Thank you.
Deyaa
  • 33
  • 1
  • 5
2
votes
0 answers

Bisimulation, bisimulation equivalence and simulation equivalence?

I got a little confused with these 3 concepts. Is there a difference between bisimulation and bisimulation equivalence and if yes, then what is it? Also, if we say that the LTS's X and Y are bisimilar, this implies they are simulation equivalent,…
Sreten Jocić
  • 21
  • 2
2
votes
1 answer

Restriction and re-labeling on CCS

In a process like $$ R \stackrel{def}=((a.\bar{b}.0)\setminus\{b\})[a\to b]\mid(\bar{b}.b.0)+\bar{b}.c.0 $$ $b$ is restricted to perform on the inner process of RHS $(a.\bar{b}.0)\setminus\{b\}$, thereafter the $a$ is relabeled to $b$. What I am…
Amir-Mousavi
  • 268
  • 2
  • 13
2
votes
1 answer

Modeling a sequential circuit as a transition system

I was asked to model the following sequential circuits C1, C2 as transition systems (i.e. identify the output y function and register functions r1, r2, r3) For C2 there appears to be not input x and only output y with a register R3. I assumed that…
jn025
  • 123
  • 4
2
votes
0 answers

Proving weak simulation

I want to prove something but I am not sure if it is the right way to do it. I have two LTS that define different semantics. A=($Q_a,Λ,\to)$, and B=$(Q_b,Λ\cup\{\beta\},\leadsto)$, where $\beta$ is a silent transition. So if I am understanding…
Mr. D
  • 121
  • 2
2
votes
1 answer

The Interleaved Transition System for 2 Independent and Concurrent Transition Systems

This question is about Model Checking for Software Formal Verification How do you model the joint behavior of 2 independent and concurrent transition systems? Specifically, given the two independent and concurrent Transition Systems below; TS1 and…
eyeezzi
  • 123
  • 4
2
votes
0 answers

How to prove that justice isn't enough to produce all naturals?

I'm doing the exercises from the first chapter of the book "Temporal Verification of Reactive Systems Safety" by Manna and Pnueli. However I find very difficult to solve the point c of problem 0.2. At point a of problem 0.2 they introduce the…
Bakuriu
  • 807
  • 7
  • 19
2
votes
2 answers

Equivalence checking: product program vs bisimulation

Consider the problem of equivalence checking two terminating sequential programs $P$ and $P'$ with the same input signatures and return statements. Two programs are equivalent if for all inputs ($args$) they terminate with the same return value…
Albi
  • 23
  • 4
2
votes
1 answer

Can CTL* express every model's behaviour

CTL* as in https://en.wikipedia.org/wiki/CTL*, is a logic that combines CTL and LTL. I know that CTL* can express everything expressible in these two languages and more. My question is whether we can model the computation tree of each LTS with CTL*
revision
  • 92
  • 5
2
votes
0 answers

Definition of nondeterministic transition system in Principles of Model Checking

In Sec 2.1 of Principles of Model Checking, by Christel Baier and Joost-Pieter Katoen, the authors talk about what constitutes a deterministic transition system (T.S.), and mention two kinds - action-deterministic and state-deterministic. Regarding…
Motorhead
  • 291
  • 1
  • 2
  • 9
2
votes
1 answer

Reducing infinite paths of a transition system to its set of sets of states

Consider a transition system defined by $\langle S,T \rangle$, where $S$ is a set of states and $T \subseteq S \times S$ is a set of transitions, where $T$ is total, i.e. for every state $s$ there is at least one outgoing transitions $(s,s') \in…
Sindri P.
  • 23
  • 4
1
vote
1 answer

CCS synchronization

Within CSS we talk about binary interactions. Does this prevent synchronizing multiple processes in one step? Example: $P_1 ::= a.D$ $P_2 ::= \overline{a}.D$ $P_3 ::= a.D$ Let's consider the following LTS: $(P_1 | P_2 | P_3)\restriction_a$ Do I get…
MoreOver
  • 135
  • 4
1
vote
0 answers

Example of Zeno timed automaton

Is there an example of a timed automaton that requires infinite clock precision, in order to be controller so as to avoid a deadlock or bad state? I.e. a transition system that consists of nodes connected by edges, and one or more real-values…
tmlen
  • 111
  • 2
1
2