A Complete Axiomatization of Finite-state ACSR Processes

Brémond-Grégoire, Patrice; Choi, Jin-Young; Lee, Insup

doi:10.1006/inco.1997.2657

Cited by 14 publications

(8 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two processes are bisimilar if, for each step of one, there is a matching, possibly multiple, step of the other, leading to bisimilar states. The formal definition of bisimulation for ACSR processes such as ∼, ≈, ∼ π and ≈ π can be found in [17]. Algorithms for checking strong and weak bisimulation for finite-state ACSR processes have been implemented in the VERSA toolset [20], thus allowing the verification of ACSR specifications.…”

Section: Analysis Of Acsr Modelsmentioning

confidence: 99%

See 1 more Smart Citation

Process Algebraic Specification of Software Defined Networks

Kang

Park

Choi

et al. 2012

2012 Fourth International Conference on Computational Intelligence, Communication Systems and Networks

Self Cite

View full text Add to dashboard Cite

In this paper, we first present a formal specification for a part of Software Defined Networks(SDN) using a process algebra called Algebra of Communicating Shard Resources(ACSR). To provide a correct and efficient solution for forwarding packets on the Software Defined Networks, ACSR can express processes running concurrently and communicating switches and a controller. Forwarding packets can be modeled as prioritized synchronization of events in ACSR. During specifying formally, we could find the Subtle Ambiguity in the SDN specification. The central contribution of this paper is to describe how to apply a formal specification method to a part of informal SDN specification. It is important to specify SDN and verify the properties of the SDN using formal specification before implementing the systems. Furthermore, we prove the correctness of ACSR specification to show deadlockfreeness using VERSA.

show abstract

Section: Analysis Of Acsr Modelsmentioning

confidence: 99%

“…The labeled transition system "→ π " is defined as follows: P α −→ π P if and only if (1) P α −→ P is an unprioritized transition, and (2) there is no unprioritized transition P β −→ P such that α ≺ β. We refer to [17] for the precise definition of ≺ and semantics of ACSR operators.…”

Section: B Overview Of Acsrmentioning

confidence: 99%

Process Algebraic Specification of Software Defined Networks

Kang

Park

Choi

et al. 2012

2012 Fourth International Conference on Computational Intelligence, Communication Systems and Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…The labeled transition system "→ π " is defined as follows: P α −→ π P if and only if (1) P α −→ P is an unprioritized transition, and (2) there is no unprioritized transition P β −→ P such that α ≺ β. We refer to [12] for the precise definition of ≺ and semantics of ACSR operators.…”

Section: The Computation Modelmentioning

confidence: 99%

“…Two processes are bisimilar if, for each step of one, there is a matching, possibly multiple, step of the other, leading to bisimilar states. The formal definition of bisimulation for ACSR processes such as ∼, ≈, ∼ π and ≈ π can be found in [12]. Algorithms for checking strong and weak bisimulation for finite-state ACSR processes have been implemented in the VERSA toolset [14], thus allowing the verification of ACSR specifications.…”

Section: Analysis Of Real-time Systems In Acsrmentioning

confidence: 99%

Model Checking of Real-Time Properties of Resource-Bound Process Algebra

Park

Lee

Choi

et al. 2009

IEICE Trans. Fundamentals

Self Cite

View full text Add to dashboard Cite

The algebra of communicating shared resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. In analyzing ACSR models, the existing techniques such as bisimulation checking and Hennessy-Milner Logic (HML) model checking are very important in theory of ACSR, but they are difficult to use for large complex system models in practice. In this paper, we suggest a framework to verify ACSR models against their requirements described in an expressive timed temporal logic. We demonstrate the usefulness of our approach with a real world case study.

show abstract

“…Actual system approaches are software-engineering oriented: for instance, [2] is designed to build specific policies or controllers, others are based on a categorization and the analysis of system constraints (global vs local in [2]), [32] integrates the real-time validation step into the software life cycle (see Figure 1), [11] proposes ACSR algebra, whose purpose is to facilitate conception and analysis into the specification step of the life cycle, etc. A more controler-oriented technique is proposed by the TIMES project [5]: producing a scheduler from the time specifications and calculating the worst response times of software tasks.…”

Section: Introductionmentioning

confidence: 99%

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Geniet

Largeteau²

2007

Theoretical Computer Science

View full text Add to dashboard Cite

International audienceThis paper presents the initial step of an aid design method earmarked for operational validation of hard real-time systems. We consider systems that are composed of sequential hard real-time tasks, which are embedded on centralized multiprocessor architectures. We introduce a model based upon untimed finite automata and meant to collect the operational behaviors of the system compatible with its time specifications, and we go on to provide a feasibility decision result for systems composed of tasks presenting CPU loads which are exact values: execution times are not WCET values. This is why we call this approach WCET-free analysis. The results we have achieved likewise involve hardware specifications such as multiprocessors and speeds of processors

show abstract

A Complete Axiomatization of Finite-state ACSR Processes

Cited by 14 publications

References 19 publications

Process Algebraic Specification of Software Defined Networks

Process Algebraic Specification of Software Defined Networks

Model Checking of Real-Time Properties of Resource-Bound Process Algebra

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Contact Info

Product

Resources

About