A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Process algebra
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Introduction to Process Algebra
Introduction to Process Algebra
Formal Description Technique Lotos: Results of the Esprit Sedos Project
Formal Description Technique Lotos: Results of the Esprit Sedos Project
A Front-End Generator for Verification Tools
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Operational Petri net semantics for CCSP
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Concurrency: State Models And Java Programs
Concurrency: State Models And Java Programs
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Visualisation for stochastic process algebras: the graphic truth
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Hi-index | 0.00 |
Process algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to support the use of process algebras to specify and analyze concurrent systems. It does not aim at guaranteeing high performances, but has been developed as a support to teaching. Systems are described as process algebras terms that are then mapped to labelled transition systems (LTSs). Properties are verified either by checking equivalence of concrete and abstract systems descriptions, or by model checking temporal formulae over the obtained LTS. A key feature of TAPAs, that makes it particularly suitable for teaching, is that it maintains a consistent double representation of each system both as a term and as a graph. Another useful didactical feature is the exhibition of counterexamples in case equivalences are not verified or the proposed formulae are not satisfied.