Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Branching processes of Petri nets
Acta Informatica
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Efficient Verification of Parallel Real–Time Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Partial order verification with PEP
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An M-Net Semantics for a Real-Time Extension of µSDL
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Time Processes for Time Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
From ATP to Timed Graphs and Hybrid Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Characterizing Timed Net Processes Categorically
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Real-Time Systems Design with PEP
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Computing a Finite Prefix of a Time Petri Net
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Unfoldings of Coloured Petri Nets
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
An algebra of petri nets with arc-based time restrictions
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Complete finite prefixes of symbolic unfoldings of safe time petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
| Hi-index | 0.00 |
Model checking of place/transition-nets based on partial order semantics has been applied successfully to the analysis of causal behaviour of distributed systems. Here, this approach is extended to the causal behaviour of time Petri nets. Expansion of a time Petri net to an equivalent P/T-net is defined, and it is shown that (an abstraction of) the McMillan unfolding of the expanded net is sufficient for model checking w.r.t. formulae of a simple branching time temporal logic L.