Three partition refinement algorithms
SIAM Journal on Computing
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Three logics for branching bisimulation
Journal of the ACM (JACM)
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Analysis of Timed Systems Based on Time-Abstracting Bisimulation
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
State space computation and analysis of Time Petri Nets
Theory and Practice of Logic Programming
CTL* model checking for time Petri nets
Theoretical Computer Science
Minimization Algorithms for Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches
Discrete Event Dynamic Systems
Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Towards Building the State Class Graph of the TSPN Model
Fundamenta Informaticae
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Covering Steps Graphs of Time Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
From time Petri nets to timed automata: an untimed approach
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Model checking bounded prioritized time Petri nets
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs
Discrete Event Dynamic Systems
On the composition of time Petri nets
Discrete Event Dynamic Systems
Comparison of different semantics for time petri nets
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Time supervision of concurrent systems using symbolic unfoldings of time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Bridging the gap between timed automata and bounded time petri nets
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Model checking of time Petri nets
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Towards Building the State Class Graph of the TSPN Model
Fundamenta Informaticae
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Minimization Algorithms for Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Discrete Event Dynamic Systems
On combining the ready sets with the covering steps methods
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
This paper is concerned with construction of some state space abstractions for Time Petri nets. State class spaces were introduced long ago by Berthomieu and Menasche as finite representations for the typically infinite state spaces of Time Petri nets, preserving their linear time temporal properties. This paper proposes a similar construction that preserves their branching time temporal properties. The construction improves a previous proposal by Yoneda and Ryuba. The method has been implemented, computing experiments are reported.