Structure theory of Petri nets: the free choice hiatus
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Branching processes of Petri nets
Acta Informatica
Verification of asynchronous circuits using time Petri net unfolding
DAC '96 Proceedings of the 33rd annual Design Automation Conference
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
Time Processes for Time Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Computing a Finite Prefix of a Time Petri Net
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Scenario Durations Characterization of T-Timed Petri Nets Using Linear Logic
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
State class constructions for branching analysis of time Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Partial Order Techniques for Distributed Discrete Event Systems: Why You Cannot Avoid Using Them
Discrete Event Dynamic Systems
Semantic domains of timed event structures
Programming and Computing Software
State Observer for DES Under Partial Observation with Time Petri Nets
Discrete Event Dynamic Systems
Coloured Petri Nets for Chronicle Recognition
Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Unifying behavioral equivalences of timed transition systems
Programming and Computing Software
Diagnosis using unfoldings of parametric time Petri nets
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Go beyond the SCOPE: a temporal situation calculus-based software tool for time petri nets
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
Formal Methods in System Design
| Hi-index | 0.00 |
Monitoring real-time concurrent systems is a challenging task. In this paper we formulate (model-based) supervision by means of hidden state history reconstruction, from event (e.g. alarm) observations. We follow a so-called true concurrency approach using time Petri nets: the model defines explicitly the causal and concurrency relations between the observable events, produced by the system under supervision on different points of observation, and constrained by time aspects. The problem is to compute on-the-fly the different partial order histories, which are the possible explanations of the observable events. We do not impose that time is observable: the aim of supervision is to infer the partial ordering of the events and their possible firing dates. This is achieved by considering a model of the system under supervision, given as a time Petri net, and the on-the-fly construction of an unfolding, guided by the observations. Using a symbolic representation, this paper presents a new definition of the unfolding of time Petri nets with dense time.