656 search results - page 67 / 132 » A Formalization of Transition P Systems |
102
Voted
LOGCOM
2006
15 years 13 days ago
2006
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision p...
165
Voted
CHARME
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
79
Voted
ACSD
2004
IEEE
15 years 4 months ago
2004
IEEE
Abstract. A delay-insensitive module communicates with its environment through wires of unbounded delay. To avoid transmission interference, the absorption of a signal transition m...
147
Voted
ICSE
2009
IEEE-ACM
16 years 1 months ago
2009
IEEE-ACM
Process models capture tasks performed by agents together with their control flow. Building and analyzing such models is important but difficult in certain areas such as safety-cr...
IANDC
2000
15 years 9 days ago
2000
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...