Comprehensive Causal Specification of Asynchronous Controller and Arbiter Behaviour

Wollowski, Ralf; Beister, Jochen

doi:10.1007/978-1-4757-3143-9_1

Cited by 7 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This can be modelled by a so-called tcb-concurrency[26] 6. For the decomposition algorithm, internal signals can be considered as outputs; see[19] for more details.…”

mentioning

confidence: 99%

Avoiding Irreducible CSC Conflicts by Internal Communication

Wist

Wollowski

Schaefer³

et al. 2009

Fundamenta Informaticae

Self Cite

View full text Add to dashboard Cite

Resynthesis of handshake specifications obtained e.g. from BALSA or TANGRAM with speed-independent logic synthesis from STGs is a promising approach. To deal with state-space explosion, we suggested STG decomposition; a problem is that decomposition can lead to irreducible CSC conflicts.Here, we present a new approach to solve such conflicts by introducing internal communication between the components. We give some first, very encouraging results for very large STGs concerning synthesis time and circuit area.

show abstract

“…This can be modelled by a so-called tcb-concurrency[26] 6. For the decomposition algorithm, internal signals can be considered as outputs; see[19] for more details.…”

mentioning

confidence: 99%

Avoiding Irreducible CSC Conflicts by Internal Communication

Wist

Wollowski

Schaefer³

et al. 2009

Fundamenta Informaticae

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, ENI-systems are used in [21] for a precise modelling of asynchronous controller and arbiter behaviour. This work puts the stress on the specification of all possible causal relationships between events (rising and falling of input and output signals) in a circuit.…”

Section: Application Of Eni and Eni ôó×ø -Systemsmentioning

confidence: 99%

Synthesis of net systems with inhibitor arcs from step transition systems

Pietkiewicz-Koutny

Proceedings Second International Conference on Application of Concurrency to System Design

View full text Add to dashboard Cite

We here consider transition systems of Elementary Net Systems with Inhibitor Arcs. There are basically two different types of non-interleaving semantics of such Petri nets, the a-posteriori and a-priori semantics. The synthesis problem for Elementary Net Systems with Inhibitor Arcs executed under the a-priori semantics (ENI) was solved in [17]. The aim of this paper is to completely characterise transition systems which can be generated by Elementary Net Systems with Inhibitor Arcs executed under the aposteriori semantics (ENI ÔÓ×Ø ). This is achieved by adapting the notion of a step transition system, i.e. one in which arcs are labelled by sets of events executed concurrently. In developing the model, we follow the standard approach in which the relationship between nets and their transition systems is established via the notion of a region. We define, and show consistency of, two behaviour preserving translations between nets and transition systems. We then compare transition systems which are generated by ENI ÔÓ×Ø and ENIsystems (called respectively TSENI ÔÓ×Ø and TSENI transition systems). Keywords: causality/partial order theory of concurrency, analysis and synthesis, structure and behaviour of nets, theory of regions.

show abstract