Keywords
BisimulationDecidabilityTimerUndecidable problemReachabilityComputer scienceEquivalence (formal languages)Theoretical computer scienceReachability problemVertex (graph theory)AutomatonAlgorithmDiscrete mathematicsMathematicsGraph
Affiliated Institutions
Related Publications
Model-checking for real-time systems
This research extends CTL model-checking to the analysis of real-time systems, whose correctness depends on the magnitudes of the timing delays. For specifications, the syntax o...
An Algorithm for the General Petri Net Reachability Problem
An algorithm is presented for the general Petri net reachability problem. It is based on a generalization of the basic reachability tree construction which is made symmetric wit...
Stochastic Petri net representation of discrete event simulations
In the context of discrete event simulation, the marking of a stochastic Petri net (SPN) corresponds to the state of the underlying stochastic process of the simulation and the ...
Publication Info
- Year
- 1993
- Type
- book-chapter
- Pages
- 302-315
- Citations
- 187
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
187
OpenAlex
10
Influential
80
CrossRef
Cite This
Kārlis Čerāns
(1993).
Decidability of bisimulation equivalences for parallel timer processes.
Lecture notes in computer science
, 302-315.
https://doi.org/10.1007/3-540-56496-9_24
Identifiers
- DOI
- 10.1007/3-540-56496-9_24