Aggregation of transitions in marking graph generation based on maximality semantics for petri nets

Authors:
Djamel Eddine Saïdouni;Nabil Belala;Messaouda Bouneb
Affiliations:
Computer Science Dept., University of Mentouri, Algeria;Computer Science Dept., University of Mentouri, Algeria;Computer Science Dept., University of Mentouri, Algeria
Venue:
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Year:
2008

Citing 17
Cited 1

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Petri net models for algebraic theories of concurrency

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Sequential and concurrent behaviour in Petri net theory

Theoretical Computer Science
Concurrency and atomicity

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Concurrent bisimulations in Petri nets

Acta Informatica
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Maximality preserving bisimulation

Theoretical Computer Science
Bisimulation and action refinement

Selected papers of the 3rd workshop on Concurrency and compositionality
Refinement of actions in event structures and causal trees

MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Action Refinement in LOTOS

Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Syntactic Action Refinement in Presence of Multiway Synchronisation

Proceedings of the International Workshop on Semantics of Specification Languages (SoSL)
Relating maximality-based semantics to action refinement in process algebras

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Adding Action Refinement to a Finite Process Algebra

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach

CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Tool Set for deciding Behavioral Equivalences

CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Maximality preservation and the ST-idea for action refinements

Advances in Petri Nets 1992, The DEMON Project

Time Petri Nets with Action Duration: A True Concurrency Real-Time Model

International Journal of Embedded and Real-Time Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an operational semantics to build maximality-based labeled transition systems (MLTS) from Place/Transition Petri nets while performing aggregation of equivalent derivations of transitions according to maximality bisimulation relation. We show that generated MLTS are equivalent to MLTS generated without aggregation. As illustration, we apply results on a ticket reservation system.