Strong bisimilarity on nets revisited (extended abstract)
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume II: parallel languages: volume II: parallel languages
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis
IEEE Transactions on Parallel and Distributed Systems
Communication and Concurrency
Degrees of Non-Determinism and Concurrency: A Petri Net View
Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Some equivalence notions for concurrent systems. An overview
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Checking properties of nets using transformation
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Place Bisimulations in Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Strong bisimilarity on nets: a new concept for comparing net semantics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Petri nets and resource bisimulation
Fundamenta Informaticae - Concurrency specification and programming
Modular modelling of software product lines with feature nets
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Syntactical colored petri nets reductions
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Similarity of generalized resources in petri nets
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Petri nets and resource bisimulation
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
| Hi-index | 0.00 |
We investigate structural equivalences on places of P/T nets that allow reductions compatible with bisimilarity. This comes with a study of two kinds of reductions: fusion of equivalent places, and replacement of some places by other ones. When effectivity issues are considered, we are lead to a variant of place bisimulation that takes into account a set of "relevant" markings.