PALM: A Technique for Process ALgebraic Specification Mining

2020 ◽  
pp. 397-418
Author(s):  
Sara Belluccini ◽  
Rocco De Nicola ◽  
Barbara Re ◽  
Francesco Tiezzi
Keyword(s):  
Algebraic Specification ◽  
Specification Mining ◽  
Process Algebraic

Process algebraic specification of DI circuits

2010 ◽  
Author(s):  
Ka Lok Man ◽  
Abhinav Asthana ◽  
K. Kapoor Hemangee ◽  
Tomas Krilavicius ◽  
Jian Chang
Keyword(s):  
Algebraic Specification ◽  
Process Algebraic

scholarly journals Enhancing Formal Methods Integration with ACP2Petri

2016 ◽  
Vol 40 (2) ◽  
pp. 221-235
Author(s):  
Slavomír Šimoňák ◽  
Martin Šolc
Keyword(s):  
User Interface ◽  
Formal Methods ◽  
Graphical User Interface ◽  
Petri Net ◽  
Algebraic Specification ◽  
Practical Experiences ◽  
Process Algebraic

The paper deals with the ACP2Petri tool, providing a transformation of process algebraic specification to equivalent Petri net-based specification. Long-term practical experiences with the tool revealed some suggestions for its update and extension. Shortcomings and limitations found are described and proposed solutions provided within the paper. Implemented extensions, simplifying the usage of the tool and providing more options for analysis of particular transformation, are also presented. One of the most evident extensions of the tool is its graphical user interface, which allows for convenient management and detailed control over the process of transformation.

scholarly journals Adversarial Specification Mining

2021 ◽  
Vol 30 (2) ◽  
pp. 1-40
Author(s):  
Hong Jin Kang ◽  
David Lo
Keyword(s):  
Specification Mining

scholarly journals The Semantics of Triveni: A process-Algebraic API for Threads + Events

1998 ◽  
Vol 14 ◽  
pp. 107-133 ◽  
Author(s):  
Christopher Colby ◽  
Lalita Jategaonkar ◽  
Radha Jagadeesan ◽  
Konstantin Läufer ◽  
Carlos Puchol
Keyword(s):  
Process Algebraic

scholarly journals CONFLICTS AND FAIR TESTING

2006 ◽  
Vol 17 (04) ◽  
pp. 797-813 ◽  
Author(s):  
ROBI MALIK ◽  
DAVID STREADER ◽  
STEVE REEVES
Keyword(s):  
Discrete Event Systems ◽  
Process Algebra ◽  
Discrete Event ◽  
Denotational Semantics ◽  
Point Of View ◽  
Algebraic Point ◽  
Event Systems ◽  
Common Task ◽  
Testing Theory ◽  
Process Algebraic

This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the context of discrete event systems, where two concurrent systems are said to be in conflict if they can get trapped in a situation where they are waiting or running endlessly, forever unable to complete their common task. In order to analyse complex discrete event systems, conflict-preserving notions of refinement and equivalence are needed. This paper characterises an appropriate refinement, called the conflict preorder, and provides a denotational semantics for it. Its relationship to other known process preorders is explored, and it is shown to generalise the fair testing preorder in process-algebra for reasoning about conflicts in discrete event systems.

Sign in / Sign up

Export Citation Format

Share Document