Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
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
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Deciding Bisimulation-Like Equivalences with Finite-State Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes
Proceedings of the 7th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
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
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Dihomotopy as a Tool in State Space Analysis
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A time-based formalism for the validation of semantic composability
Winter Simulation Conference
On Validation of Semantic Composability in Data-Driven Simulation
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
An Analysis of the Cost of Validating Semantic Composability
PADS '11 Proceedings of the 2011 IEEE Workshop on Principles of Advanced and Distributed Simulation
PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation
Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
An integrated approach for the validation of emergence in component-based simulation models
Proceedings of the Winter Simulation Conference
| Hi-index | 0.01 |
In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of µ-calculus formulas. We apply the reduction to the class of transition systems generated by Petri nets and pushdown automata, and obtain several decidability/ complexity corollaries for unlabelled systems. Probably the most interesting result is undecidability of strong bisimilarity for unlabelled Petri nets.