scholarly journals Interpolant-Based Transition Relation Approximation

2005 ◽  
pp. 39-51 ◽  
Author(s):  
Ranjit Jhala ◽  
K. L. McMillan
Keyword(s):  
Transition Relation

Modelling Nondeterministic Concurrent Processes with Event Structures

1991 ◽  
Vol 14 (1) ◽  
pp. 39-73
Author(s):  
Rita Loogen ◽  
Ursula Goltz
Keyword(s):  
Dynamic Behaviour ◽  
Partially Ordered Sets ◽  
Parallel Composition ◽  
Ordered Sets ◽  
Communicating Sequential Processes ◽  
Partially Ordered ◽  
Event Structures ◽  
Transition Relation ◽  
Concurrent Processes ◽  
Sequential Processes

We present a non-interleaving model for non deterministic concurrent processes that is based on labelled event structures. We define operators on labelled event structures like parallel composition, nondeterministic combination, choice, prefixing and hiding. These operators correspond to the operations of the “Theory of Communicating Sequential Processes” (TCSP). Infinite processes are defined using the metric approach. The dynamic behaviour of event structures is defined by a transition relation which describes the execution of partially ordered sets of actions, abstracting from internal events.

scholarly journals Proof-relevant π-calculus: a constructive account of concurrency and causality

2017 ◽  
Vol 28 (9) ◽  
pp. 1541-1577 ◽  
Author(s):  
ROLY PERERA ◽  
JAMES CHENEY
Keyword(s):  
Formal Definition ◽  
Meta Data ◽  
Transition Relation ◽  
Π Calculus ◽  
De Bruijn ◽  
Target States ◽  
Definition Of ◽  
De Bruijn Indices ◽  
Proof Terms

We present a formalisation in Agda of the theory of concurrent transitions, residuation and causal equivalence of traces for the π-calculus. Our formalisation employs de Bruijn indices and dependently typed syntax, and aligns the ‘proved transitions’ proposed by Boudol and Castellani in the context of CCS with the proof terms naturally present in Agda's representation of the labelled transition relation. Our main contributions are proofs of the ‘diamond lemma’ for the residuals of concurrent transitions and a formal definition of equivalence of traces up to permutation of transitions.In the π-calculus, transitions represent propagating binders whenever their actions involve bound names. To accommodate these cases, we require a more general diamond lemma where the target states of equivalent traces are no longer identical, but are related by abraidingthat rewires the bound and free names to reflect the particular interleaving of events involving binders. Our approach may be useful for modelling concurrency in other languages where transitions carry meta-data sensitive to particular interleavings, such as dynamically allocated memory addresses.

Shyness, Sociability, and Parental Support for the College Transition: Relation to Adolescents’ Adjustment

2006 ◽  
Vol 35 (1) ◽  
pp. 68-77 ◽  
Author(s):  
Nina S. Mounts ◽  
David P. Valentiner ◽  
Katherine L. Anderson ◽  
Michelle K. Boswell
Keyword(s):  
College Transition ◽  
Parental Support ◽  
Transition Relation

Relative Quaternion State Transition Relation

1979 ◽  
Vol 2 (1) ◽  
pp. 44-48 ◽  
Author(s):  
Ronald A. Mayo
Keyword(s):  
State Transition ◽  
Transition Relation

On computing the transitive closure of a state transition relation

1993 ◽  
Author(s):  
Yusuke Matsunaga ◽  
Patrick C. McGeer ◽  
Robert K. Brayton
Keyword(s):  
State Transition ◽  
Transitive Closure ◽  
Transition Relation

Symbolic FSM traversals based on the transition relation

1997 ◽  
Vol 16 (5) ◽  
pp. 448-457 ◽  
Author(s):  
G. Cabodi ◽  
P. Camurati
Keyword(s):  
Transition Relation
Sign in / Sign up

Export Citation Format

Share Document